Pointers versus arithmetic in PRAMs

Proceedings of the Eighth Annual Structure in Complexity Theory Conference

Volumn , Issue , 1993, Pages 239-252

  Dymond, Patrick W ^a   Fich, Faith E ^a   Nishimura, Naomi ^a   Ragde, Prabhakar ^a   Ruzzo, Walter L ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTEXT FREE LANGUAGES; PATTERN RECOGNITION; RANDOM ACCESS STORAGE;

ARITHMETICALLY RESTRICTED PRAMS; CONTEXT FREE LANGUAGE RECOGNITION; MEMORY ACCESS RESTRICTIONS; PARALLEL POINTER MACHINES; PARALLEL RANDOM ACCESS MEMORIES (PRAMS); SHARED DATA STRUCTURES; STEP-BY-STEP N-PROCESSOR SIMULATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0027297636     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)