Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (33)

Action Title Date Authors
+
Essentially tight bounds for rainbow cycles in proper edge‐colourings 2025-04-01 Noga Alon Matija Bucić Lisa Sauermann Dmitrii Zakharov Or Zamir
Improving Algorithmic Efficiency using Cryptography 2025-02-18 Vinod Vaikuntanathan Or Zamir
+
Sumsets in the Hypercube 2025-02-04 Noga Alon Or Zamir
Unbounded Error Correcting Codes 2024-11-07 Klim Efremenko Or Zamir
Optimality of Frequency Moment Estimation 2024-11-04 Mark Braverman Or Zamir
Sumsets in the Hypercube 2024-03-25 Noga Alon Or Zamir
Testing Sumsets is Hard 2024-01-01 Xi Chen Shivam Nadimpalli Tim Randolph Rocco A. Servedio Or Zamir
Excuse me, sir? Your language model is leaking (information) 2024-01-01 Or Zamir
Algorithmic Applications of Hypergraph and Partition Containers 2023-05-16 Or Zamir
Undetectable Watermarks for Language Models 2023-01-01 Miranda Christ Sam Gunn Or Zamir
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing 2023-01-01 Kasper Green Larsen Rasmus Pagh Toniann Pitassi Or Zamir
Essentially tight bounds for rainbow cycles in proper edge-colourings 2023-01-01 Noga Alon Matija Bucić Lisa Sauermann Dmitrii Zakharov Or Zamir
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond 2022-06-09 Amir Abboud Karl Bringmann Seri Khoury Or Zamir
Planting Undetectable Backdoors in Machine Learning Models 2022-01-01 Shafi Goldwasser Michael P. Kim Vinod Vaikuntanathan Or Zamir
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond 2022-01-01 Amir Abboud Karl Bringmann Seri Khoury Or Zamir
The wrong direction of Jensen's inequality is algorithmically right 2022-01-01 Or Zamir
Algorithmic Applications of Hypergraph and Partition Containers 2022-01-01 Or Zamir
+
Faster algorithm for Unique (k, 2)-CSP. 2021-10-07 Or Zamir
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering 2021-07-05 Shyam Narayanan Sandeep Silwal Piotr Indyk Or Zamir
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering 2021-01-01 Shyam Narayanan Sandeep Silwal Piotr Indyk Or Zamir
+
Tight Space Complexity of the Coin Problem. 2021-01-01 Mark Braverman Sumegha Garg Or Zamir
Faster algorithm for Unique $(k,2)$-CSP 2021-01-01 Or Zamir
Breaking the $2^n$ barrier for 5-coloring and 6-coloring 2020-01-01 Or Zamir
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges 2019-11-01 Jacob Holm Valerie King Mikkel Thorup Or Zamir Uri Zwick
Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges. 2019-09-24 Jacob Holm Valerie King Mikkel Thorup Or Zamir Uri Zwick
Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges 2019-01-01 Jacob Rubæk Holm Valerie King Mikkel Thorup Or Zamir Uri Zwick
Subtree Isomorphism Revisited 2018-06-16 Amir Abboud Artūrs Bačkurs Thomas Dueholm Hansen Virginia Vassilevska Williams Or Zamir
+
Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps 2018-02-20 Haim Kaplan László Kozma Or Zamir Uri Zwick
Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps 2018-01-01 Haim Kaplan László Kozma Or Zamir Uri Zwick
Subtree Isomorphism Revisited 2015-12-21 Amir Abboud Artūrs Bačkurs Thomas Dueholm Hansen Virginia Vassilevska Williams Or Zamir
Motion Planning for Unlabeled Discs with Optimality Guarantees 2015-07-13 Kiril Solovey Jingjin Yu Or Zamir Dan Halperin
Motion Planning for Unlabeled Discs with Optimality Guarantees 2015-01-01 Kiril Solovey Jingjin Yu Or Zamir Dan Halperin
Subtree Isomorphism Revisited 2015-01-01 Amir Abboud Artūrs Bačkurs Thomas Dueholm Hansen Virginia Vassilevska Williams Or Zamir

Commonly Cited References

Action Title Date Authors # of times referenced
Set Partitioning via Inclusion-Exclusion 2009-01-01 Andreas Björklund Thore Husfeldt Mikko Koivisto 3
+
A note on the complexity of the chromatic number problem 1976-08-01 Eugene L. Lawler 3
On random <i>k</i>‐out subgraphs of large graphs 2016-03-30 Alan Frieze Tony Johansson 2
Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons 2015-01-01 Aviv Adler Mark de Berg Dan Halperin Kiril Solovey 2
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs 2018-01-01 Andrea Lincoln Virginia Vassilevska Williams Ryan Williams 2
A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs 2013-01-01 Jingjin Yu 2
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages 2013-01-01 Oren Salzman Michael Hemmer Dan Halperin 2
+
Enumerating maximal independent sets with applications to graph colouring 2004-04-29 Jesper Makholm Byskov 2
k-Color Multi-robot Motion Planning 2013-01-01 Kiril Solovey Dan Halperin 2
+
The Scottish book : mathematics from the Scottish Café 1981-01-01 R. Daniel Mauldin 2
Multi-agent Path Planning and Network Flow 2013-01-01 Jingjin Yu Steven M. LaValle 2
Dynamic graph connectivity with improved worst case update time and sublinear space 2015-01-01 David R. Gibb Bruce M. Kapron Valerie King Nolan Thorn 2
<i>k</i>-color multi-robot motion planning 2013-10-22 Kiril Solovey Dan Halperin 2
+
Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees 1998-09-01 Timothy M. Chan 2
+
Maximum matchings in a class of random graphs 1986-04-01 Alan Frieze 2
Small Maximal Independent Sets and Faster Exact Graph Coloring 2001-01-01 David Eppstein 2
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems 2014-10-01 Amir Abboud Virginia Vassilevska Williams 2
On the hardness of unlabeled multi-robot motion planning 2015-07-13 Kiril Solovey Dan Halperin 2
On the hardness of unlabeled multi-robot motion planning 2016-11-01 Kiril Solovey Dan Halperin 2
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning 2015-01-01 Kiril Solovey Oren Salzman Dan Halperin 2
Distance Optimal Formation Control on Graphs with a Tight Convergence Time Guarantee 2012-01-01 Jingjin Yu Steven M. LaValle 2
+
On the connectivity of randomm-orientable graphs and digraphs 1982-12-01 T. I. Fenner Alan Frieze 2
Distance optimal formation control on graphs with a tight convergence time guarantee 2012-12-01 Jingjin Yu M. LaValle 2
Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications 1984-01-01 Daniel Kornhauser Gary L. Miller Paul G. Spirakis 2
+
On cliques in graphs 1965-03-01 J. W. Moon Leo Moser 2
Introduction to Random Graphs 2015-10-26 Alan Frieze Michał Karoński 2
Planning optimal paths for multiple robots on graphs 2013-05-01 Jingjin Yu Steven M. LaValle 2
+
On Triples in Arithmetic Progression 1999-12-01 Jean Bourgain 1
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs 2005-05-01 Ben Green 1
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition 2013-01-01 Khodakhast Bibak 1
The number of unit distances is almost linear for most norms 2010-09-29 Jiřı́ Matoušek 1
+
A polynomial bound in Freiman's theorem 2002-06-15 Mei-Chu Chang 1
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping 2015-10-01 Karl Bringmann Marvin Künnemann 1
On the Size of Dissociated Bases 2011-05-23 Vsevolod F. Lev Raphael Yuster 1
+
Cycles of even length in graphs 1974-04-01 J. A. Bondy Miklós Simonovits 1
+
An Entropy Approach to the Hard-Core Model on Bipartite Graphs 2001-05-01 Jeff Kahn 1
+
Families with Infants 2016-04-25 Alexander Golovnev Alexander S. Kulikov Ivan Mihajlin 1
+
On the number of graphs without 4-cycles 1982-01-01 Daniel J. Kleitman Kenneth Winston 1
+
On the density of families of sets 1972-07-01 N. Sauer 1
A geometric approach to shortest bounded curvature paths 2014-03-19 José Ayala David Kirszenblat J Rubinstein 1
Exact algorithms for maximum independent set 2017-06-07 Mingyu Xiao Hiroshi Nagamochi 1
On some extremal problems in graph theory 1965-06-01 P. Erdős 1
Small complete minors above the extremal edge density 2015-02-01 A. Shapira Benny Sudakov 1
First-order queries on structures of bounded degree are computable with constant delay 2007-08-01 Arnaud Durand Étienne Grandjean 1
+
On the distortion required for embedding finite metric spaces into normed spaces 1996-12-01 Jiřı́ Matoušek 1
Independent sets in hypergraphs 2014-08-07 József Balogh Robert Morris Wojciech Samotij 1
+
The chromatic number of random Cayley graphs 2013-06-07 Noga Alon 1
Multiplying matrices faster than coppersmith-winograd 2012-05-19 Virginia Vassilevska Williams 1
From k-SAT to k-CSP: Two Generalized Algorithms 2008-01-01 Liang Li Xin Li Tian Liu Ke Xü 1
Counting sets with small sumset and applications 2015-01-16 Ben Green Robert Morris 1