ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Pointer jumping requires concurrent read
Full text PdfPdf (1.33 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing table of contents
El Paso, Texas, United States
Pages: 549 - 558  
Year of Publication: 1997
ISBN:0-89791-888-6
Authors
Noam Nisan  Department of Computer Science, The Hebrew University of Jerusalem, Jerusalem 91904, Israel
Ziv Bar-Yossef  Department of Computer Science, The Hebrew University of Jerusalem, Jerusalem 91904, Israel
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/258533.258648
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
CDR86
Stephen Cook , Cynthia Dwork , Ru&duml;ger Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM Journal on Computing, v.15 n.1, p.87-97, Feb. 1986  [doi>10.1137/0215006]
 
FW90
Faith E. Fich , Avi Wigderson, Toward understanding exclusive read, SIAM Journal on Computing, v.19 n.4, p.718-727, Aug. 1990  [doi>10.1137/0219050]
 
GNR89
E. Gafni , J. Naor , P. Radg, On separating the EREW and CREW PRAM models, Theoretical Computer Science, v.68 n.3, p.343-346, 12 Nov. 1989  [doi>10.1016/0304-3975(89)90169-2]
 
KR88
R. Karp and V. Ramachandran. A survey of parallel algorithms for shared-memory machines, 1988. Handbook of Theoret. Comput. Sci., Volume A.
 
Sim83
Hans-Ulrich Simon, A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions, Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory, p.439-444, August 21-27, 1983
 
Sni85
M. Snir. On parallel searching. SIAM J. Comput., 14:688-708, 1985.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  B. Hardware
  B.7 INTEGRATED CIRCUITS
      B.7.1 Types and Design Styles
          Subjects: Memory technologies

  D. Software
  D.1 PROGRAMMING TECHNIQUES

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.0 General
          Subjects: Parallel algorithms
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis


General Terms:
Algorithms, Design, Performance, Theory, Verification

Collaborative Colleagues:
Noam Nisan: colleagues
Ziv Bar-Yossef: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player