default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmi Litman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1981
[b1]Ami Litman:
אפיונים קומבינטוריים של תכונות נדירות בעולם הקונסטרוקטיבילי (Combinatorical characterization of definable properties in the Constructible world.). Hebrew University of Jerusalem, Israel, 1981
Journal Articles
- 2011
- [j22]Ami Litman, Shiri Moran-Schein:
On Centralized Smooth Scheduling. Algorithmica 60(2): 464-480 (2011) - [j21]Tamir Levi, Ami Litman:
The Strongest Model of Computation Obeying 0-1 Principles. Theory Comput. Syst. 48(2): 374-388 (2011) - [j20]Tamir Levi, Ami Litman:
Bitonic sorters of minimal depth. Theor. Comput. Sci. 412(22): 2282-2295 (2011) - 2009
- [j19]Ami Litman, Shiri Moran-Schein:
On smooth sets of integers. Discret. Math. 309(4): 797-813 (2009) - [j18]Ami Litman, Shiri Moran-Schein:
Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game. Theory Comput. Syst. 45(2): 325-354 (2009) - [j17]Guy Even, Tamir Levi, Ami Litman:
Optimal conclusive sets for comparator networks. Theor. Comput. Sci. 410(14): 1369-1376 (2009) - [j16]Tamir Levi, Ami Litman:
Accelerating certain outputs of merging and sorting networks. Theor. Comput. Sci. 410(38-40): 3725-3732 (2009) - 2001
- [j15]Ami Litman:
Exposed Layouts of the Butterfly Network. J. Interconnect. Networks 2(2): 233-247 (2001) - [j14]Ami Litman, Shiri Moran-Schein:
Fast, Minimal, and Oblivious Routing Algorithms on the Mesh with Bounded Queues. J. Interconnect. Networks 2(4): 445-469 (2001) - 1998
- [j13]Shai Ben-David, Ami Litman:
Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes. Discret. Appl. Math. 86(1): 3-25 (1998) - [j12]Moti Frances, Ami Litman:
Optimal Mistake Bound Learning is Hard. Inf. Comput. 144(1): 66-82 (1998) - [j11]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) - [j10]Shimon Even, Ami Litman, Arnold L. Rosenberg:
Monochromatic Paths and Triangulated Graphs. SIAM J. Discret. Math. 11(4): 546-556 (1998) - 1997
- [j9]Guy Even, Ami Litman:
Overcoming chip-to-chip delays and clock skews. Integr. 24(2): 119-133 (1997) - [j8]Shimon Even, Ami Litman, Peter Winkler:
Computing with Snakes in Directed Networks of Automata. J. Algorithms 24(1): 158-170 (1997) - [j7]Moti Frances, Ami Litman:
On Covering Problems of Codes. Theory Comput. Syst. 30(2): 113-119 (1997) - [j6]Shimon Even, Ami Litman:
Layered cross product - A technique to construct interconnection networks. Networks 29(4): 219-223 (1997) - 1994
- [j5]Shimon Even, Ami Litman:
On the Capabilities of Systolic Systems. Math. Syst. Theory 27(1): 3-28 (1994) - 1989
- [j4]Ophir Frieder, Ami Litman, Mark E. Segal:
DUNIX: Distributed operating systems education via experimentation. Microprocessing and Microprogramming 27(1-5): 811-818 (1989) - 1988
- [j3]Ami Litman:
The DUNIX Distributed Operating System. ACM SIGOPS Oper. Syst. Rev. 22(1): 42-51 (1988) - 1985
- [j2]Amnon Barak, Ami Litman:
MOS: A Multicomputer Distributed Operating System. Softw. Pract. Exp. 15(8): 725-737 (1985) - 1980
- [j1]Aaron Beller, Ami Litman:
A Strengthening of Jensen's Principles. J. Symb. Log. 45(2): 251-264 (1980)
Conference and Workshop Papers
- 2007
- [c14]Guy Even, Tamir Levi, Ami Litman:
Optimal Conclusive Sets for Comparator Networks. SIROCCO 2007: 304-317 - 2006
- [c13]Ami Litman:
Parceling the Butterfly and the Batcher Sorting Network. Essays in Memory of Shimon Even 2006: 129-142 - [c12]Ami Litman, Shiri Moran-Schein:
Smooth scheduling under variable rates or the analog-digital confinement game. SPAA 2006: 74-83 - 2005
- [c11]Ami Litman, Shiri Moran-Schein:
On distributed smooth scheduling. SPAA 2005: 76-85 - 2002
- [c10]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
- [c9]Ami Litman, Shiri Moran-Schein:
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues. SPAA 2001: 21-31 - 1998
- [c8]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 - 1996
- [c7]Guy Even, Ami Litman:
Overcoming chip-to-chip delays and clock skews. ASAP 1996: 199-208 - [c6]Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. SPAA 1996: 170-175 - 1994
- [c5]Shimon Even, Ami Litman:
A Unified Scheme for Routing in Expander Based Networks. CIAC 1994: 125-135 - 1992
- [c4]Shimon Even, Ami Litman:
Layered Cross Product - A Technique to Construct Interconnection Networks. SPAA 1992: 60-69 - 1991
- [c3]Shimon Even, Ami Litman:
On the Capabilities of Systolic Systems (Extended Abstract). SPAA 1991: 357-367 - 1990
- [c2]Shimon Even, Ami Litman, Peter Winkler:
Computing with Snakes in Directed Networks of Automata (Extended Abstract). FOCS 1990: 740-745 - 1988
- [c1]Ami Litman:
Autonomy and interdependence in the DUNIX system. ACM SIGOPS European Workshop 1988
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
