( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Bounds for the Predecessor Problem.

, и . STOC, стр. 295-304. ACM, (1999)

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.

Tanja Beament

Heidi Paul-Toebelmann

Volker Pauls

Erich Paulke

Barbara Paulick

 

Другие публикации лиц с тем же именем

Counting of Query Expressions: Limitations of Propositional Methods., , , и . ICDT, стр. 177-188. OpenProceedings.org, (2014)Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube., и . CoRR, (2016)A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness., , , и . Comput. Complex., 15 (4): 391-432 (2006)A General Sequential Time-Space Tradeoff for Finding Unique Elements. STOC, стр. 197-203. ACM, (1989)More on the relative strength of counting principles., и . Proof Complexity and Feasible Arithmetics, том 39 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 13-35. DIMACS/AMS, (1996)A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata., , , , и . SIAM J. Comput., 28 (3): 1051-1072 (1999)Optimal bounds for decision problems on the CRCW PRAM., и . J. ACM, 36 (3): 643-670 (1989)Optimizing symbolic model checking for statecharts, , , , , и . Software Engineering, IEEE Transactions on, 27 (2): 170--190 (2001)Proof complexity.. Computational Complexity Theory, том 10 из IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)Using Problem Structure for Efficient Clause Learning., , и . SAT, том 2919 из Lecture Notes in Computer Science, стр. 242-256. Springer, (2003)