![]() | ![]() |
| 2011 | ||
|---|---|---|
| 5 | Tamir Levi, Ami Litman: Bitonic sorters of minimal depth. Theor. Comput. Sci. 412(22): 2282-2295 (2011) | |
| 4 | Tamir Levi, Ami Litman: The Strongest Model of Computation Obeying 0-1 Principles. Theory Comput. Syst. 48(2): 374-388 (2011) | |
| 2009 | ||
| 3 | Guy Even, Tamir Levi, Ami Litman: Optimal conclusive sets for comparator networks. Theor. Comput. Sci. 410(14): 1369-1376 (2009) | |
| 2 | Tamir Levi, Ami Litman: Accelerating certain outputs of merging and sorting networks. Theor. Comput. Sci. 410(38-40): 3725-3732 (2009) | |
| 2007 | ||
| 1 | Guy Even, Tamir Levi, Ami Litman: Optimal Conclusive Sets for Comparator Networks. SIROCCO 2007: 304-317 | |
| 1 | Guy Even | [1] [3] |
| 2 | Ami Litman | [1] [2] [3] [4] [5] |
Data released under the ODC-BY 1.0 license — See also our legal information page