( en | de | ru )

 

Disambiguation of "Beame, Paul"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal bounds for decision problems on the CRCW PRAM.

, and . J. ACM, 36 (3): 643-670 (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tanja Beament

Jean Paul

Christian Paul

Daniela Paul

Georg Paula

 

Other publications of authors with the same name

A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness., , , and . Comput. Complex., 15 (4): 391-432 (2006)More on the relative strength of counting principles., and . Proof Complexity and Feasible Arithmetics, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 13-35. DIMACS/AMS, (1996)A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata., , , , and . SIAM J. Comput., 28 (3): 1051-1072 (1999)Counting of Query Expressions: Limitations of Propositional Methods., , , and . ICDT, page 177-188. OpenProceedings.org, (2014)Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube., and . CoRR, (2016)Optimal bounds for decision problems on the CRCW PRAM., and . J. ACM, 36 (3): 643-670 (1989)Optimizing symbolic model checking for statecharts, , , , , and . Software Engineering, IEEE Transactions on, 27 (2): 170--190 (2001)Using Problem Structure for Efficient Clause Learning., , and . SAT, volume 2919 of Lecture Notes in Computer Science, page 242-256. Springer, (2003)Optimal Bounds for the Predecessor Problem., and . STOC, page 295-304. ACM, (1999)Distributed Computing on TRansitive Networks: The Thorus., and . STACS, volume 349 of Lecture Notes in Computer Science, page 294-303. Springer, (1989)