Bitonic sorters of minimal depth | 0 | 0.34 | 2011 |
On Centralized Smooth Scheduling | 1 | 0.35 | 2011 |
The Strongest Model of Computation Obeying 0-1 Principles | 3 | 0.48 | 2011 |
On smooth sets of integers | 1 | 0.35 | 2009 |
Accelerating certain outputs of merging and sorting networks | 2 | 0.43 | 2009 |
Optimal conclusive sets for comparator networks | 4 | 0.60 | 2009 |
Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game | 2 | 0.38 | 2006 |
Parceling the butterfly and the batcher sorting network | 0 | 0.34 | 2006 |
On distributed smooth scheduling | 4 | 0.45 | 2005 |
Exposed Layouts of the Butterfly Network | 1 | 0.54 | 2001 |
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues | 1 | 0.36 | 2001 |
A Tight Layout of the Butterfly Network | 17 | 0.96 | 1998 |
On the Bisection Width and Expansion of Butterfly Networks | 9 | 0.61 | 1998 |
Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes | 24 | 1.90 | 1998 |
Optimal mistake bound learning is hard | 4 | 0.60 | 1998 |
Monochromatic Paths and Triangulated Graphs | 0 | 0.34 | 1998 |
Computing with snakes in directed networks of automata | 19 | 1.78 | 1997 |
On Covering Problems of Codes | 80 | 4.60 | 1997 |
Overcoming chip-to-chip delays and clock skews | 1 | 0.40 | 1996 |
On the capabilities of systolic systems | 9 | 1.00 | 1994 |
A unified scheme for routing in expander based networks | 0 | 0.34 | 1994 |
Layered cross product—a technique to construct interconnection networks | 15 | 1.19 | 1992 |
On the capabilities of systolic systems (extended abstract) | 2 | 0.66 | 1991 |
Computing with Snakes in Directed Networks of Automata (Extended Abstract) | 0 | 0.34 | 1990 |
The DUNIX distributed operating system | 2 | 0.50 | 1988 |
Autonomy and interdependence in the DUNIX system | 0 | 0.34 | 1988 |
MOS: a multicomputer distributed operating system | 36 | 28.34 | 1985 |
A Strengthening of Jensen's Principles | 3 | 1.26 | 1980 |