Name
Papers
Collaborators
AMI LITMAN
28
18
Citations 
PageRank 
Referers 
240
49.78
397
Referees 
References 
272
209
Search Limit
100397
Title
Citations
PageRank
Year
Bitonic sorters of minimal depth00.342011
On Centralized Smooth Scheduling10.352011
The Strongest Model of Computation Obeying 0-1 Principles30.482011
On smooth sets of integers10.352009
Accelerating certain outputs of merging and sorting networks20.432009
Optimal conclusive sets for comparator networks40.602009
Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game20.382006
Parceling the butterfly and the batcher sorting network00.342006
On distributed smooth scheduling40.452005
Exposed Layouts of the Butterfly Network10.542001
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues10.362001
A Tight Layout of the Butterfly Network170.961998
On the Bisection Width and Expansion of Butterfly Networks90.611998
Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes241.901998
Optimal mistake bound learning is hard40.601998
Monochromatic Paths and Triangulated Graphs00.341998
Computing with snakes in directed networks of automata191.781997
On Covering Problems of Codes804.601997
Overcoming chip-to-chip delays and clock skews10.401996
On the capabilities of systolic systems91.001994
A unified scheme for routing in expander based networks00.341994
Layered cross product—a technique to construct interconnection networks151.191992
On the capabilities of systolic systems (extended abstract)20.661991
Computing with Snakes in Directed Networks of Automata (Extended Abstract)00.341990
The DUNIX distributed operating system20.501988
Autonomy and interdependence in the DUNIX system00.341988
MOS: a multicomputer distributed operating system3628.341985
A Strengthening of Jensen's Principles31.261980