Author of the publication

Explicit Deterministic Constructions for Membership in the Bitprobe Model.

, , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 290-299. Springer, (2001)

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.

 

Other publications of authors with the same name

Space efficient data structures for nearest larger neighbor., , , , and . J. Discrete Algorithms, (2016)Selection and Sorting in the "Restore" Model., , and . ACM Trans. Algorithms, 14 (2): 11:1-11:18 (2018)A Quartic Kernel for Pathwidth-One Vertex Deletion., , and . WG, volume 6410 of Lecture Notes in Computer Science, page 196-207. (2010)Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems., , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 139-151. Springer, (2006)Selection from Read-Only Memory and Sorting with Optimum Data Movement., and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 380-391. Springer, (1992)A Polynomial Sized Kernel for Tracking Paths Problem., , , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 94-107. Springer, (2018)Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs., , , , and . STACS, volume 5 of LIPIcs, page 251-262. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles., , , and . Algorithmica, 68 (2): 504-530 (2014)The Budgeted Unique Coverage Problem and Color-Coding., , , and . CSR, volume 5675 of Lecture Notes in Computer Science, page 310-321. Springer, (2009)Structural Parameterizations of Tracking Paths Problem., and . ICTCS, volume 2756 of CEUR Workshop Proceedings, page 15-27. CEUR-WS.org, (2020)