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

• 2011
• 
  Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang:
  Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2): 17:1-17:21 (2011)
• 
  Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
  Finding witnesses by peeling. ACM Trans. Algorithms 7(2): 24:1-24:15 (2011)
• 
  Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti:
  Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms 7(4): 52:1-52:27 (2011)
• 
  Avraham Ben-Aroya, Sivan Toledo:
  Competitive analysis of flash memory algorithms. ACM Trans. Algorithms 7(2): 23:1-23:37 (2011)
• 
  Philip Bille, Inge Li Gørtz:
  The tree inclusion problem: In linear space and faster. ACM Trans. Algorithms 7(3): 38:1-38:47 (2011)
• 
  Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie:
  Minimizing flow time in the wireless gathering problem. ACM Trans. Algorithms 7(3): 33:1-33:20 (2011)
• 
  Paul S. Bonsma, Frederic Dorn:
  Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Trans. Algorithms 7(4): 44:1-44:19 (2011)
• 
  Allan Borodin, David Cashman, Avner Magen:
  How well can primal-dual and local-ratio algorithms perform? ACM Trans. Algorithms 7(3): 29:1-29:26 (2011)
• 
  Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote:
  Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms 7(4): 43:1-43:27 (2011)
• 
  Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani:
  An improved approximation algorithm for resource allocation. ACM Trans. Algorithms 7(4): 48:1-48:7 (2011)
• 
  Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania:
  Decision trees for entity identification: Approximation algorithms and hardness results. ACM Trans. Algorithms 7(2): 15:1-15:22 (2011)
• 
  Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
  Broadcast scheduling: Algorithms and complexity. ACM Trans. Algorithms 7(4): 47:1-47:14 (2011)
• 
  Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev:
  Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms 7(2): 18:1-18:17 (2011)
• 
  Yongwook Choi, Wojciech Szpankowski:
  Constrained pattern matching. ACM Trans. Algorithms 7(2): 25:1-25:19 (2011)
• 
  Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
  S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7(3): 30:1-30:21 (2011)
• 
  Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu:
  The optimality of the online greedy algorithm in carpool and chairman assignment problems. ACM Trans. Algorithms 7(3): 37:1-37:22 (2011)
• 
  Graham Cormode, S. Muthukrishnan, Ke Yi:
  Algorithms for distributed functional monitoring. ACM Trans. Algorithms 7(2): 21:1-21:20 (2011)
• 
  Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
  Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms 7(4): 41:1-41:14 (2011)
• 
  Jeff Edmonds, Kirk Pruhs:
  Cake cutting really is not a piece of cake. ACM Trans. Algorithms 7(4): 51:1-51:12 (2011)
• 
  Michael Elkin:
  Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. ACM Trans. Algorithms 7(2): 20:1-20:17 (2011)
• 
  Dimitris Fotakis:
  Memoryless facility location in one pass. ACM Trans. Algorithms 7(4): 49:1-49:24 (2011)
• 
  Zachary Friggstad, Mohammad R. Salavatipour:
  Minimizing movement in mobile facility location problems. ACM Trans. Algorithms 7(3): 28:1-28:22 (2011)
• 
  Bin Fu, Ming-Yang Kao, Lusheng Wang:
  Discovering almost any hidden motif from multiple sequences. ACM Trans. Algorithms 7(2): 26:1-26:18 (2011)
• 
  Martin Gairing, Burkhard Monien, Karsten Tiemann:
  Routing (un-) splittable flow in games with player-specific affine latency functions. ACM Trans. Algorithms 7(3): 31:1-31:31 (2011)
• 
  Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck:
  Data structures for mergeable trees. ACM Trans. Algorithms 7(2): 14:1-14:30 (2011)
• 
  Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
  Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7(2): 22:1-22:21 (2011)
• 
  Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang:
  A new upper bound 2.5545 on 2D Online Bin Packing. ACM Trans. Algorithms 7(4): 50:1-50:18 (2011)
• 
  Alexander Izsak, Nicholas Pippenger:
  Carry propagation in multiplication by constants. ACM Trans. Algorithms 7(4): 54:1-54:11 (2011)
• 
  Tobias Jacobs:
  Constant factor approximations for the hotlink assignment problem. ACM Trans. Algorithms 7(2): 16:1-16:19 (2011)
• 
  Samir Khuller, Azarakhsh Malekian, Julián Mestre:
  To fill or not to fill: The gas station problem. ACM Trans. Algorithms 7(3): 36:1-36:16 (2011)

skipping 24 more matches