Ami Litman

Available identifiers

Publication	Date of Publication	Type
Bitonic sorters of minimal depth	2011-05-10	Paper
On centralized smooth scheduling	2011-05-10	Paper
The strongest model of computation obeying 0-1 Principles	2011-03-30	Paper
Smooth scheduling under variable rates or the analog-digital confinement game	2009-10-19	Paper
Accelerating certain outputs of merging and sorting networks	2009-09-10	Paper
On smooth sets of integers	2009-04-09	Paper
Optimal conclusive sets for comparator networks	2009-03-30	Paper
Optimal Conclusive Sets for Comparator Networks	2007-11-15	Paper
Optimal mistake bound learning is hard	2000-05-23	Paper
Overcoming chip-to-chip delays and clock skews	1999-01-12	Paper
Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes	1998-09-27	Paper
A tight layout of the butterfly network	1998-09-27	Paper
Monochromatic Paths and Triangulated Graphs	1998-09-21	Paper
Computing with Snakes in Directed Networks of Automata	1998-02-04	Paper
Layered cross product&mdashA technique to construct interconnection networks	1997-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q4858440	1996-02-06	Paper
On the capabilities of systolic systems	1994-10-31	Paper
A strengthening of Jensen's □ principles	1980-01-01	Paper
On the monadic theory of \(\omega_1\) without A.C	1976-01-01	Paper

This page was built for person: Ami Litman