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

• 2000
• 
  Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof:
  Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL). ACM J. Exp. Algorithmics 5: 16 (2000)
• 
  Jesper Bojesen, Jyrki Katajainen, Maz Spork:
  Performance Engineering Case Study: Heap Construction. ACM J. Exp. Algorithmics 5: 15 (2000)
• 
  Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer:
  An Experimental Study of Priority Queues in External Memory. ACM J. Exp. Algorithmics 5: 17 (2000)
• 
  Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov:
  Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioning. ACM J. Exp. Algorithmics 5: 5 (2000)
• 
  Kyunrak Chong, Sartaj Sahni:
  Correspondence-Based Data Structures for Double-Ended Priority Queues. ACM J. Exp. Algorithmics 5: 2 (2000)
• 
  Shlomit Dascal, Uzi Vishkin:
  Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. ACM J. Exp. Algorithmics 5: 10 (2000)
• 
  David Eppstein:
  Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. ACM J. Exp. Algorithmics 5: 1 (2000)
• 
  Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra:
  The Design and Implementation of Planar Maps in CGAL. ACM J. Exp. Algorithmics 5: 13 (2000)
• 
  Matthew S. Levine:
  Finding the Right Cutting Planes for the TSP. ACM J. Exp. Algorithmics 5: 6 (2000)
• 
  Matthias Müller-Hannemann, Alexander Schwartz:
  Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ACM J. Exp. Algorithmics 5: 8 (2000)
• 
  Gonzalo Navarro, Mathieu Raffinot:
  Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata. ACM J. Exp. Algorithmics 5: 4 (2000)
• 
  Naila Rahman, Rajeev Raman:
  Analysing Cache Effects in Distribution Sorting. ACM J. Exp. Algorithmics 5: 14 (2000)
• 
  Peter Sanders:
  Fast Priority Queues for Cached Memory. ACM J. Exp. Algorithmics 5: 7 (2000)
• 
  Frank Schulz, Dorothea Wagner, Karsten Weihe:
  Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM J. Exp. Algorithmics 5: 12 (2000)
• 
  Tetsuo Shibuya:
  Computing the nxm Shortest Paths Efficiently. ACM J. Exp. Algorithmics 5: 9 (2000)
• 
  Renato Fonseca F. Werneck, João C. Setubal:
  Finding Minimum Congestion Spanning Trees. ACM J. Exp. Algorithmics 5: 11 (2000)
• 
  Li Xiao, Xiaodong Zhang, Stefan A. Kubricht:
  Improving Memory Performance of Sorting Algorithms. ACM J. Exp. Algorithmics 5: 3 (2000)