A Strengthening of Jensen's Principles. - Aaron Beller; Ami Litman (J. Symb. Log., 1980)

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

MOS: A Multicomputer Distributed Operating System. - Amnon Barak; Ami Litman (Softw. Pract. Exp., 1985)

Autonomy and interdependence in the DUNIX system. - Ami Litman (ACM SIGOPS European Workshop, 1988)

The DUNIX Distributed Operating System. - Ami Litman (ACM SIGOPS Oper. Syst. Rev., 1988)

DUNIX: Distributed operating systems education via experimentation. - Ophir Frieder; Ami Litman; Mark E. Segal (Microprocessing and Microprogramming, 1989)

Computing with Snakes in Directed Networks of Automata (Extended Abstract) - Shimon Even; Ami Litman; Peter Winkler 001 (FOCS, 1990)

On the Capabilities of Systolic Systems (Extended Abstract). - Shimon Even; Ami Litman (SPAA, 1991)

A Unified Scheme for Routing in Expander Based Networks. - Shimon Even; Ami Litman (CIAC, 1994)

On the Capabilities of Systolic Systems. - Shimon Even; Ami Litman (Math. Syst. Theory, 1994)

Overcoming chip-to-chip delays and clock skews. - Guy Even; Ami Litman (Integr., 1997)

Computing with Snakes in Directed Networks of Automata. - Shimon Even; Ami Litman; Peter Winkler 001 (J. Algorithms, 1997)

On Covering Problems of Codes. - Moti Frances; Ami Litman (Theory Comput. Syst., 1997)

Layered cross product - A technique to construct interconnection networks. - Shimon Even; Ami Litman (Networks, 1997)

On the Bisection Width and Expansion of Butterfly Networks. - Claudson F. Bornstein; Ami Litman; Bruce M. Maggs; Ramesh K. Sitaraman; Tal Yatzkar (IPPS/SPDP, 1998)

Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes. - Shai Ben-David; Ami Litman (Discret. Appl. Math., 1998)

Optimal Mistake Bound Learning is Hard. - Moti Frances; Ami Litman (Inf. Comput., 1998)

A Tight Layout of the Butterfly Network. - Aythan Avior; Tiziana Calamoneri; Shimon Even; Ami Litman; Arnold L. Rosenberg (Theory Comput. Syst., 1998)

Monochromatic Paths and Triangulated Graphs. - Shimon Even; Ami Litman; Arnold L. Rosenberg (SIAM J. Discret. Math., 1998)

Exposed Layouts of the Butterfly Network. - Ami Litman (J. Interconnect. Networks, 2001)

Fast, Minimal, and Oblivious Routing Algorithms on the Mesh with Bounded Queues. - Ami Litman; Shiri Moran-Schein (J. Interconnect. Networks, 2001)

Large scale clock skew scheduling techniques for improved reliability of digital synchronous VLSI circuits. - Roy Mader; Eby G. Friedman; Ami Litman; Ivan S. Kourtev (ISCAS (1), 2002)

On distributed smooth scheduling. - Ami Litman; Shiri Moran-Schein (SPAA, 2005)

Parceling the Butterfly and the Batcher Sorting Network. - Ami Litman (Essays in Memory of Shimon Even, 2006)

On smooth sets of integers. - Ami Litman; Shiri Moran-Schein (Discret. Math., 2009)

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game. - Ami Litman; Shiri Moran-Schein (Theory Comput. Syst., 2009)

Optimal conclusive sets for comparator networks. - Guy Even; Tamir Levi; Ami Litman (Theor. Comput. Sci., 2009)

Accelerating certain outputs of merging and sorting networks. - Tamir Levi; Ami Litman (Theor. Comput. Sci., 2009)

On Centralized Smooth Scheduling. - Ami Litman; Shiri Moran-Schein (Algorithmica, 2011)

The Strongest Model of Computation Obeying 0-1 Principles. - Tamir Levi; Ami Litman (Theory Comput. Syst., 2011)

Bitonic sorters of minimal depth. - Tamir Levi; Ami Litman (Theor. Comput. Sci., 2011)