2 citations · 2 across the 4 of their papers we have counts for
5 papers
Time to Cycle
Nir Lavee, Nati Linial
Consider the random process that starts with vertices and no edges, where the edges of are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\bi…
Does Your Blockchain Need Multidimensional Transaction Fees?
Nir Lavee, Noam Nisan, Mallesh Pai +1
Blockchains have block-size limits to ensure the entire cluster can keep up with the tip of the chain. These block-size limits are usually single-dimensional, but richer multidimen…
Counting Permutation Patterns with Multidimensional Trees
Gal Beniamini, Nir Lavee
We consider the well-studied pattern counting problem: given a permutation and an integer , count the number of order-isomorphic occurrences of every pat…
How Balanced Can Permutations Be?
Gal Beniamini, Nir Lavee, Nati Linial
A permutation is -balanced if every permutation of order occurs in equally often, through order-isomorphism. In this paper, we explicitly construct $…
Certifying DFA Bounds for Recognition and Separation
Orna Kupferman, Nir Lavee, Salomon Sickert
The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular winning conditions in order to genera…