• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 41 matches

• 2022
• 
  Ron Slossberg, Oron Anschel, Amir Markovitz, Ron Litman, Aviad Aberdam, Shahar Tsiper, Shai Mazor, Jon Wu, R. Manmatha:
  On Calibration of Scene-Text Recognition Models. ECCV Workshops (4) 2022: 263-279
• 2020
• 
  Amir Markovitz, Inbal Lavi, Or Perel, Shai Mazor, Roee Litman:
  Can You Read Me Now? Content Aware Rectification Using Angle Supervision. ECCV (12) 2020: 208-223
• 
  Amir Markovitz, Inbal Lavi, Or Perel, Shai Mazor, Roee Litman:
  Can You Read Me Now? Content Aware Rectification using Angle Supervision. CoRR abs/2008.02231 (2020)
• 
  Ron Slossberg, Oron Anschel, Amir Markovitz, Ron Litman, Aviad Aberdam, Shahar Tsiper, Shai Mazor, Jon Wu, R. Manmatha:
  On Calibration of Scene-Text Recognition Models. CoRR abs/2012.12643 (2020)
• 2011
• 
  Ami Litman, Shiri Moran-Schein:
  On Centralized Smooth Scheduling. Algorithmica 60(2): 464-480 (2011)
• 
  Tamir Levi, Ami Litman:
  The Strongest Model of Computation Obeying 0-1 Principles. Theory Comput. Syst. 48(2): 374-388 (2011)
• 
  Tamir Levi, Ami Litman:
  Bitonic sorters of minimal depth. Theor. Comput. Sci. 412(22): 2282-2295 (2011)
• 2009
• 
  Ami Litman, Shiri Moran-Schein:
  On smooth sets of integers. Discret. Math. 309(4): 797-813 (2009)
• 
  Ami Litman, Shiri Moran-Schein:
  Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game. Theory Comput. Syst. 45(2): 325-354 (2009)
• 
  Guy Even, Tamir Levi, Ami Litman:
  Optimal conclusive sets for comparator networks. Theor. Comput. Sci. 410(14): 1369-1376 (2009)
• 
  Tamir Levi, Ami Litman:
  Accelerating certain outputs of merging and sorting networks. Theor. Comput. Sci. 410(38-40): 3725-3732 (2009)
• 2007
• 
  Guy Even, Tamir Levi, Ami Litman:
  Optimal Conclusive Sets for Comparator Networks. SIROCCO 2007: 304-317
• 2006
• 
  Ami Litman:
  Parceling the Butterfly and the Batcher Sorting Network. Essays in Memory of Shimon Even 2006: 129-142
• 
  Ami Litman, Shiri Moran-Schein:
  Smooth scheduling under variable rates or the analog-digital confinement game. SPAA 2006: 74-83
• 2005
• 
  Ami Litman, Shiri Moran-Schein:
  On distributed smooth scheduling. SPAA 2005: 76-85
• 2002
• 
  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
• 
  Ami Litman:
  Exposed Layouts of the Butterfly Network. J. Interconnect. Networks 2(2): 233-247 (2001)
• 
  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)
• 
  Ami Litman, Shiri Moran-Schein:
  Fast, minimal and oblivious routing algorithms on the mesh with bounded queues. SPAA 2001: 21-31
• 1998
• 
  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)
• 
  Moti Frances, Ami Litman:
  Optimal Mistake Bound Learning is Hard. Inf. Comput. 144(1): 66-82 (1998)
• 
  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)
• 
  Shimon Even, Ami Litman, Arnold L. Rosenberg:
  Monochromatic Paths and Triangulated Graphs. SIAM J. Discret. Math. 11(4): 546-556 (1998)
• 
  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
• 1997
• 
  Guy Even, Ami Litman:
  Overcoming chip-to-chip delays and clock skews. Integr. 24(2): 119-133 (1997)
• 
  Shimon Even, Ami Litman, Peter Winkler:
  Computing with Snakes in Directed Networks of Automata. J. Algorithms 24(1): 158-170 (1997)
• 
  Moti Frances, Ami Litman:
  On Covering Problems of Codes. Theory Comput. Syst. 30(2): 113-119 (1997)
• 
  Shimon Even, Ami Litman:
  Layered cross product - A technique to construct interconnection networks. Networks 29(4): 219-223 (1997)
• 1996
• 
  Guy Even, Ami Litman:
  Overcoming chip-to-chip delays and clock skews. ASAP 1996: 199-208
• 
  Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
  A Tight Layout of the Butterfly Network. SPAA 1996: 170-175

skipping 11 more matches