Ami Litman

According to our database1, Ami Litman authored at least 31 papers between 1980 and 2011.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Bitonic sorters of minimal depth.
Theor. Comput. Sci., 2011

The Strongest Model of Computation Obeying 0-1 Principles.
Theory Comput. Syst., 2011

On Centralized Smooth Scheduling.
Algorithmica, 2011

2009
Accelerating certain outputs of merging and sorting networks.
Theor. Comput. Sci., 2009

Optimal conclusive sets for comparator networks.
Theor. Comput. Sci., 2009

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game.
Theory Comput. Syst., 2009

On smooth sets of integers.
Discret. Math., 2009

2006
Parceling the Butterfly and the Batcher Sorting Network.
Proceedings of the Theoretical Computer Science, 2006

2005
On distributed smooth scheduling.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2002
Large scale clock skew scheduling techniques for improved reliability of digital synchronous VLSI circuits.
Proceedings of the 2002 International Symposium on Circuits and Systems, 2002

2001
Fast, Minimal, and Oblivious Routing Algorithms on the Mesh with Bounded Queues.
J. Interconnect. Networks, 2001

Exposed Layouts of the Butterfly Network.
J. Interconnect. Networks, 2001

1998
Monochromatic Paths and Triangulated Graphs.
SIAM J. Discret. Math., 1998

A Tight Layout of the Butterfly Network.
Theory Comput. Syst., 1998

Optimal Mistake Bound Learning is Hard.
Inf. Comput., 1998

Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes.
Discret. Appl. Math., 1998

On the Bisection Width and Expansion of Butterfly Networks.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997
Layered cross product - A technique to construct interconnection networks.
Networks, 1997

On Covering Problems of Codes.
Theory Comput. Syst., 1997

Computing with Snakes in Directed Networks of Automata.
J. Algorithms, 1997

Overcoming chip-to-chip delays and clock skews.
Integr., 1997

1994
On the Capabilities of Systolic Systems.
Math. Syst. Theory, 1994

A Unified Scheme for Routing in Expander Based Networks.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1991
On the Capabilities of Systolic Systems (Extended Abstract).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

1990
Computing with Snakes in Directed Networks of Automata (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
DUNIX: Distributed operating systems education via experimentation.
Microprocessing and Microprogramming, 1989

1988
The DUNIX Distributed Operating System.
ACM SIGOPS Oper. Syst. Rev., 1988

Autonomy and interdependence in the DUNIX system.
Proceedings of the 3rd ACM SIGOPS European Workshop: Autonomy or Interdependence in Distributed Systems? Cambridge, 1988

1985
MOS: A Multicomputer Distributed Operating System.
Softw. Pract. Exp., 1985

1981
אפיונים קומבינטוריים של תכונות נדירות בעולם הקונסטרוקטיבילי (Combinatorical characterization of definable properties in the Constructible world.).
PhD thesis, 1981

1980
A Strengthening of Jensen's Principles.
J. Symb. Log., 1980


  Loading...