23 citations · 39 across the 15 of their papers we have counts for
5 papers · 1 filter
The hat guessing number of graphs
Noga Alon, Omri Ben-Eliezer, Chong Shangguan +1
Consider the following hat guessing game: players are placed on vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of possible colors.…
Testing local properties of arrays
Omri Ben-Eliezer
We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of -dimensional arrays is -local if it can be defined by a fa…
Ordered Graph Limits and Their Applications
Omri Ben-Eliezer, Eldar Fischer, Amit Levi +1
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described…
Semi-random graph process
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg +3
We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on vertices. In every round of the process, one vert…
Earthmover Resilience and Testing in Ordered Structures
Omri Ben-Eliezer, Eldar Fischer
One of the main challenges in property testing is to characterize those properties that are testable with a constant number of queries. For unordered structures such as graphs and…