| 2009 |
| 29 | EE | Guy Even,
Tamir Levi,
Ami Litman:
Optimal conclusive sets for comparator networks.
Theor. Comput. Sci. 410(14): 1369-1376 (2009) |
| 2007 |
| 28 | EE | Guy Even,
Tamir Levi,
Ami Litman:
Optimal Conclusive Sets for Comparator Networks.
SIROCCO 2007: 304-317 |
| 2006 |
| 27 | EE | Ami Litman:
Parceling the Butterfly and the Batcher Sorting Network.
Essays in Memory of Shimon Even 2006: 129-142 |
| 26 | EE | Ami Litman,
Shiri Moran-Schein:
Smooth scheduling under variable rates or the analog-digital confinement game.
SPAA 2006: 74-83 |
| 2005 |
| 25 | EE | Ami Litman,
Shiri Moran-Schein:
On distributed smooth scheduling.
SPAA 2005: 76-85 |
| 2002 |
| 24 | EE | Roy Mader,
Eby G. Friedman,
Ami Litman,
Ivan S. Kourtev:
Large scale clock skew scheduling techniques for improved reliability of digital synchronous VLSI circuits.
ISCAS (1) 2002: 357-360 |
| 2001 |
| 23 | EE | Ami Litman,
Shiri Moran-Schein:
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues.
SPAA 2001: 21-31 |
| 22 | | Ami Litman:
Exposed Layouts of the Butterfly Network.
Journal of Interconnection Networks 2(2): 233-247 (2001) |
| 21 | | Ami Litman,
Shiri Moran-Schein:
Fast, Minimal, and Oblivious Routing Algorithms on the Mesh with Bounded Queues.
Journal of Interconnection Networks 2(4): 445-469 (2001) |
| 1998 |
| 20 | EE | Claudson F. Bornstein,
Ami Litman,
Bruce M. Maggs,
Ramesh K. Sitaraman,
Tal Yatzkar:
On the Bisection Width and Expansion of Butterfly Networks.
IPPS/SPDP 1998: 144-150 |
| 19 | EE | Shai Ben-David,
Ami Litman:
Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes.
Discrete Applied Mathematics 86(1): 3-25 (1998) |
| 18 | | Moti Frances,
Ami Litman:
Optimal Mistake Bound Learning is Hard.
Inf. Comput. 144(1): 66-82 (1998) |
| 17 | EE | Shimon Even,
Ami Litman,
Arnold L. Rosenberg:
Monochromatic Paths and Triangulated Graphs.
SIAM J. Discrete Math. 11(4): 546-556 (1998) |
| 16 | EE | Aythan Avior,
Tiziana Calamoneri,
Shimon Even,
Ami Litman,
Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network.
Theory Comput. Syst. 31(4): 475-488 (1998) |
| 1997 |
| 15 | EE | Guy Even,
Ami Litman:
Overcoming chip-to-chip delays and clock skews.
Integration 24(2): 119-133 (1997) |
| 14 | | Shimon Even,
Ami Litman,
Peter Winkler:
Computing with Snakes in Directed Networks of Automata.
J. Algorithms 24(1): 158-170 (1997) |
| 13 | EE | Shimon Even,
Ami Litman:
Layered cross product - A technique to construct interconnection networks.
Networks 29(4): 219-223 (1997) |
| 12 | | Moti Frances,
Ami Litman:
On Covering Problems of Codes.
Theory Comput. Syst. 30(2): 113-119 (1997) |
| 1996 |
| 11 | EE | Guy Even,
Ami Litman:
Overcoming chip-to-chip delays and clock skews.
ASAP 1996: 199-208 |
| 10 | | Aythan Avior,
Tiziana Calamoneri,
Shimon Even,
Ami Litman,
Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network.
SPAA 1996: 170-175 |
| 1994 |
| 9 | | Shimon Even,
Ami Litman:
A Unified Scheme for Routing in Expander Based Networks.
CIAC 1994: 125-135 |
| 8 | | Shimon Even,
Ami Litman:
On the Capabilities of Systolic Systems.
Mathematical Systems Theory 27(1): 3-28 (1994) |
| 1992 |
| 7 | EE | Shimon Even,
Ami Litman:
Layered Cross Product - A Technique to Construct Interconnection Networks.
SPAA 1992: 60-69 |
| 1991 |
| 6 | EE | Shimon Even,
Ami Litman:
On the Capabilities of Systolic Systems (Extended Abstract).
SPAA 1991: 357-367 |
| 1990 |
| 5 | | Shimon Even,
Ami Litman,
Peter Winkler:
Computing with Snakes in Directed Networks of Automata (Extended Abstract)
FOCS 1990: 740-745 |
| 1988 |
| 4 | EE | Ami Litman:
Autonomy and interdependence in the DUNIX system.
ACM SIGOPS European Workshop 1988 |
| 3 | | Ami Litman:
The DUNIX Distributed Operating System.
Operating Systems Review 22(1): 42-51 (1988) |
| 1985 |
| 2 | | Amnon Barak,
Ami Litman:
MOS: A Multicomputer Distributed Operating System.
Softw., Pract. Exper. 15(8): 725-737 (1985) |
| 1980 |
| 1 | | Aaron Beller,
Ami Litman:
A Strengthening of Jensen's Principles.
J. Symb. Log. 45(2): 251-264 (1980) |