Author of the publication

Counting Triangles under Updates in Worst-Case Optimal Time.

, , , , and . ICDT, volume 127 of LIPIcs, page 4:1-4:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Learning Models over Relational Data: A Brief Tutorial., , , , and . SUM, volume 11940 of Lecture Notes in Computer Science, page 423-432. Springer, (2019)Bag Query Containment and Information Theory., , , and . PODS, page 95-112. ACM, (2020)On the Hardness of Approximating the Min-Hack Problem., , , , and . J. Comb. Optim., 9 (3): 295-311 (2005)Skew strikes back: new developments in the theory of join algorithms., , and . SIGMOD Record, 42 (4): 5-16 (2013)Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)., , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 557-568. Springer, (2011)CQMP: a mesh-based multicast routing protocol with consolidated query packets., and . WCNC, page 2168-2174. IEEE, (2005)On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks., , , and . INFOCOM, page 1721-1729. IEEE, (2007)Nonblocking WDM Switches Based on Arrayed Waveguide Grating and Limited Wavelength Conversion., , and . INFOCOM, page 1352-1362. IEEE, (2004)A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints., , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 510-520. Springer, (2008)Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion., , and . STACS, volume 14 of LIPIcs, page 230-241. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)