( en | de | ru )

 

Disambiguation of "Beame, Paul"

Author of the publication

copydeleteadd this publication to your clipboard
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems.

, and . STOC, page 688-697. ACM, (2002)

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

Mario Paulig

Michael Paul

Jens Paulsen

Gerhard Paul

 

Other publications of authors with the same name

Optimizing symbolic model checking for statecharts, , , , , and . Software Engineering, IEEE Transactions on, 27 (2): 170--190 (2001)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)Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems., and . STOC, page 688-697. ACM, (2002)Using Problem Structure for Efficient Clause Learning., , and . SAT, volume 2919 of Lecture Notes in Computer Science, page 242-256. Springer, (2003)Proof complexity.. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)A General Sequential Time-Space Tradeoff for Finding Unique Elements. STOC, page 197-203. ACM, (1989)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)Distributed Computing on TRansitive Networks: The Thorus., and . STACS, volume 349 of Lecture Notes in Computer Science, page 294-303. Springer, (1989)Optimal Bounds for the Predecessor Problem., and . STOC, page 295-304. ACM, (1999)