• 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 52 matches

• 2008
• 
  Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
  Compact name-independent routing with minimum stretch. ACM Trans. Algorithms 4(3): 37:1-37:12 (2008)
• 
  Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
  An O(n^2.75) algorithm for incremental topological ordering. ACM Trans. Algorithms 4(4): 39:1-39:14 (2008)
• 
  Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
  Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Trans. Algorithms 4(4): 46:1-46:21 (2008)
• 
  Laurent Alonso, Edward M. Reingold:
  Determining plurality. ACM Trans. Algorithms 4(3): 26:1-26:19 (2008)
• 
  Laurent Alonso, Edward M. Reingold:
  Average-case lower bounds for the plurality problem. ACM Trans. Algorithms 4(3): 27:1-27:17 (2008)
• 
  Elliot Anshelevich, Lisa Zhang:
  Path decomposition under a new cost measure with applications to optical network design. ACM Trans. Algorithms 4(1): 15:1-15:20 (2008)
• 
  Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
  The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms 4(1): 9:1-9:30 (2008)
• 
  Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky:
  Deterministic conflict-free coloring for intervals: From offline to online. ACM Trans. Algorithms 4(4): 44:1-44:18 (2008)
• 
  Jérémy Barbay, Claire Kenyon:
  Alternation and redundancy analysis of the intersection problem. ACM Trans. Algorithms 4(1): 4:1-4:18 (2008)
• 
  Daniel K. Blandford, Guy E. Blelloch:
  Compact dictionaries for variable-length keys and data with applications. ACM Trans. Algorithms 4(2): 17:1-17:25 (2008)
• 
  Markus Bläser:
  A new approximation algorithm for the asymmetric TSP with triangle inequality. ACM Trans. Algorithms 4(4): 47:1-47:15 (2008)
• 
  Joan Boyar, Paul Medvedev:
  The relative worst order ratio applied to seat reservation. ACM Trans. Algorithms 4(4): 48:1-48:22 (2008)
• 
  Adam L. Buchsbaum:
  Guest editorial. ACM Trans. Algorithms 4(2): 16:1 (2008)
• 
  Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian:
  Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1): 8:1-8:28 (2008)
• 
  Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Mohammad Ali Safari, Amit Sahai:
  Improved algorithms for optimal embeddings. ACM Trans. Algorithms 4(4): 45:1-45:14 (2008)
• 
  Shuchi Chawla, Anupam Gupta, Harald Räcke:
  Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Trans. Algorithms 4(2): 22:1-22:18 (2008)
• 
  Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
  On the approximability of some network design problems. ACM Trans. Algorithms 4(2): 23:1-23:17 (2008)
• 
  Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
  Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4(4): 42:1-42:18 (2008)
• 
  Artur Czumaj, Christian Sohler:
  Testing Euclidean minimum spanning trees in the plane. ACM Trans. Algorithms 4(3): 31:1-31:23 (2008)
• 
  Yefim Dinitz, Shay Solomon:
  Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Trans. Algorithms 4(3): 25:1-25:9 (2008)
• 
  Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko:
  Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4(3): 34:1-34:17 (2008)
• 
  Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
  Atomic congestion games among coalitions. ACM Trans. Algorithms 4(4): 52:1-52:27 (2008)
• 
  Gianni Franceschini, Roberto Grossi:
  No sorting? better searching! ACM Trans. Algorithms 4(1): 2:1-2:13 (2008)
• 
  Éric Fusy, Gilles Schaeffer, Dominique Poulalhon:
  Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling. ACM Trans. Algorithms 4(2): 19:1-19:48 (2008)
• 
  Harold N. Gabow, Shuxin Nie:
  Finding a long directed cycle. ACM Trans. Algorithms 4(1): 7:1-7:21 (2008)
• 
  Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
  Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1): 11:1-11:20 (2008)
• 
  Qian-Ping Gu, Hisao Tamaki:
  Optimal branch-decomposition of planar graphs in O(n³) Time. ACM Trans. Algorithms 4(3): 30:1-30:13 (2008)
• 
  Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
  Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4(1): 10:1-10:34 (2008)
• 
  Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Jim Pugh:
  The collective memory of amnesic processes. ACM Trans. Algorithms 4(1): 12:1-12:31 (2008)
• 
  Louis Ibarra:
  Fully dynamic algorithms for chordal graphs and split graphs. ACM Trans. Algorithms 4(4): 40:1-40:20 (2008)

skipping 22 more matches