search result

Cover von Optimal Two-Round Communication Lower Bound for Graph Connectivity via Pointer Chasing

Optimal Two-Round Communication Lower Bound for Graph Connectivity via Pointer Chasing

Year: 2026
Media group: LIPIcs
Cover von Set Membership with Two Classical and Quantum Bit Probes

Set Membership with Two Classical and Quantum Bit Probes

Year: 2022
Media group: LIPIcs
Cover von Property B

Property B

Two-Coloring Non-Uniform Hypergraphs
Year: 2021
Media group: LIPIcs
Cover von Distance-Preserving Subgraphs of Interval Graphs

Distance-Preserving Subgraphs of Interval Graphs

Year: 2017
Media group: LIPIcs
Cover von The Zero-Error Randomized Query Complexity of the Pointer Function

The Zero-Error Randomized Query Complexity of the Pointer Function

Year: 2016
Media group: LIPIcs
Cover von Tight Bounds for Communication-Assisted Agreement Distillation

Tight Bounds for Communication-Assisted Agreement Distillation

Year: 2016
Media group: LIPIcs
Cover von Topology Matters in Communication
article in 2014 IEEE Annual Symposium on Foundations of Computer Science : pp. 631-640
Search for this author
Year: 2014
Publisher: Los Alamitos, IEEE
Series: 2014 IEEE Annual Symposium on Foundations of Computer Science FOCS
Media group: ARTICLE
Cover von Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes

Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes

Year: 2020
Media group: LIPIcs
Cover von Set Membership with Non-Adaptive Bit Probes

Set Membership with Non-Adaptive Bit Probes

Year: 2017
Media group: LIPIcs
Cover von FST TCS 2003
foundations of software technology and theoretical computer science : 23rd conference, Mumbai, India, December 15 - 17, 2003 : proceedings
Search for this author
Year: 2003
Publisher: Berlin, Springer
Series: Lecture notes in computer science; 2914
Media group: MONOGRAPHIE
OPEN V 11.1.0.0