Ami Litman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2011

Bitonic sorters of minimal depthTamir Levi, Ami Litman. TCS, 412(22):2282-2295, 2011. [doi]

The Strongest Model of Computation Obeying 0-1 PrinciplesTamir Levi, Ami Litman. mst, 48(2):374-388, 2011. [doi]

On Centralized Smooth SchedulingAmi Litman, Shiri Moran-Schein. algorithmica, 60(2):464-480, 2011. [doi]

2009

Optimal conclusive sets for comparator networksGuy Even, Tamir Levi, Ami Litman. TCS, 410(14):1369-1376, 2009. [doi]

Accelerating certain outputs of merging and sorting networksTamir Levi, Ami Litman. TCS, 410(38-40):3725-3732, 2009. [doi]

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement GameAmi Litman, Shiri Moran-Schein. mst, 45(2):325-354, 2009. [doi]

On smooth sets of integersAmi Litman, Shiri Moran-Schein. DM, 309(4):797-813, 2009. [doi]

2007

Optimal Conclusive Sets for Comparator NetworksGuy Even, Tamir Levi, Ami Litman. sirocco 2007: 304-317 [doi]

2006

Parceling the Butterfly and the Batcher Sorting NetworkAmi Litman. BIRTHDAY 2006: 129-142 [doi]

Smooth scheduling under variable rates or the analog-digital confinement gameAmi Litman, Shiri Moran-Schein. spaa 2006: 74-83 [doi]

2005

On distributed smooth schedulingAmi Litman, Shiri Moran-Schein. spaa 2005: 76-85 [doi]

2002

Large scale clock skew scheduling techniques for improved reliability of digital synchronous VLSI circuitsRoy Mader, Eby G. Friedman, Ami Litman, Ivan S. Kourtev. iscas 2002: 357-360 [doi]

2001

Fast, minimal and oblivious routing algorithms on the mesh with bounded queuesAmi Litman, Shiri Moran-Schein. spaa 2001: 21-31 [doi]

Fast, Minimal, and Oblivious Routing Algorithms on the Mesh with Bounded QueuesAmi Litman, Shiri Moran-Schein. join, 2(4):445-469, 2001.

Exposed Layouts of the Butterfly NetworkAmi Litman. join, 2(2):233-247, 2001.

1998

1997

Computing with Snakes in Directed Networks of AutomataShimon Even, Ami Litman, Peter Winkler. jal, 24(1):158-170, 1997.

Layered cross product - A technique to construct interconnection networksShimon Even, Ami Litman. networks, 29(4):219-223, 1997. [doi]

Overcoming chip-to-chip delays and clock skewsGuy Even, Ami Litman. integration, 24(2):119-133, 1997. [doi]

On Covering Problems of CodesMoti Frances, Ami Litman. mst, 30(2):113-119, 1997.

1996

A Tight Layout of the Butterfly NetworkAythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg. spaa 1996: 170-175

Overcoming chip-to-chip delays and clock skewsGuy Even, Ami Litman. asap 1996: 199-208 [doi]

1994

On the Capabilities of Systolic SystemsShimon Even, Ami Litman. mst, 27(1):3-28, 1994.

A Unified Scheme for Routing in Expander Based NetworksShimon Even, Ami Litman. ciac 1994: 125-135

1992

Layered Cross Product - A Technique to Construct Interconnection NetworksShimon Even, Ami Litman. spaa 1992: 60-69 [doi]

1991

On the Capabilities of Systolic Systems (Extended Abstract)Shimon Even, Ami Litman. spaa 1991: 357-367 [doi]

1990

Computing with Snakes in Directed Networks of Automata (Extended Abstract)Shimon Even, Ami Litman, Peter Winkler. focs 1990: 740-745

1989

DUNIX: Distributed operating systems education via experimentationOphir Frieder, Ami Litman, Mark E. Segal. jsa, 27(1-5):811-818, 1989. [doi]

1988

Autonomy and interdependence in the DUNIX systemAmi Litman. sigopsE 1988: [doi]

The DUNIX Distributed Operating SystemAmi Litman. sigops, 22(1):42-51, 1988.

1985

MOS: A Multicomputer Distributed Operating SystemAmnon Barak, Ami Litman. SPE, 15(8):725-737, 1985.

1981

אפיונים קומבינטוריים של תכונות נדירות בעולם הקונסטרוקטיבילי (Combinatorical characterization of definable properties in the Constructible world.)Ami Litman. PhD thesis, Hebrew University of Jerusalem, Israel, 1981. [doi]

1980

A Strengthening of Jensen s PrinciplesAaron Beller, Ami Litman. JSYML, 45(2):251-264, 1980.

Sign in or sign up to see more results.

runs on WebDSL