The following pages link to Ami Litman (Q533869):
Displaying 19 items.
- Bitonic sorters of minimal depth (Q533870) (← links)
- On centralized smooth scheduling (Q534791) (← links)
- The strongest model of computation obeying 0-1 Principles (Q633766) (← links)
- Smooth scheduling under variable rates or the analog-digital confinement game (Q733734) (← links)
- Accelerating certain outputs of merging and sorting networks (Q837163) (← links)
- Optimal conclusive sets for comparator networks (Q1008736) (← links)
- On smooth sets of integers (Q1011716) (← links)
- On the monadic theory of \(\omega_1\) without A.C (Q1234296) (← links)
- A tight layout of the butterfly network (Q1265167) (← links)
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes (Q1265741) (← links)
- Optimal mistake bound learning is hard (Q1271479) (← links)
- A strengthening of Jensen's □ principles (Q3905271) (← links)
- Monochromatic Paths and Triangulated Graphs (Q4210223) (← links)
- Overcoming chip-to-chip delays and clock skews (Q4224365) (← links)
- On the capabilities of systolic systems (Q4277374) (← links)
- Layered cross product&mdashA technique to construct interconnection networks (Q4347276) (← links)
- Computing with Snakes in Directed Networks of Automata (Q4349702) (← links)
- (Q4858440) (← links)
- Optimal Conclusive Sets for Comparator Networks (Q5425979) (← links)
