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

• 2009
• 
  Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz:
  On Computational Models for Flash Memory Devices. SEA 2009: 16-27
• 
  Kamal Al-Bawani, Alexander Souza:
  Competitive Buffer Management with Stochastic Packet Arrivals. SEA 2009: 28-39
• 
  Ernst Althaus, Daniel Dumitriu:
  Fast and Accurate Bounds on Linear Programs. SEA 2009: 40-50
• 
  Anne Auger, Nikolaus Hansen, Jorge M. Perez Zerpa, Raymond Ros, Marc Schoenauer:
  Experimental Comparisons of Derivative Free Optimization Algorithms. SEA 2009: 3-15
• 
  Heinz Bast:
  Parallelism in Current and Future Processors - Challenges and Support for Designing Optimal Algorithms. SEA 2009: 1
• 
  Reinhard Bauer, Dorothea Wagner:
  Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. SEA 2009: 51-62
• 
  Michael A. Bender:
  From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering. SEA 2009: 2
• 
  Mark de Berg, Peter Hachenberger:
  Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. SEA 2009: 63-75
• 
  Paolo Bertasi, Marco Bressan, Enoch Peserico:
  psort, Yet Another Fast Stable Sorting Software. SEA 2009: 76-88
• 
  Raouf Boutaba, Martin Karsten, Maxwell Young:
  A Heuristic for Fair Correlation-Aware Resource Placement. SEA 2009: 89-100
• 
  Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn:
  Measuring the Similarity of Geometric Graphs. SEA 2009: 101-112
• 
  Adan Cosgaya-Lozano, Norbert Zeh:
  A Heuristic Strong Connectivity Algorithm for Large Graphs. SEA 2009: 113-124
• 
  Daniel Delling, Dorothea Wagner:
  Pareto Paths with SHARC. SEA 2009: 125-136
• 
  Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
  An Application of Self-organizing Data Structures to Compression. SEA 2009: 137-148
• 
  Holger Flier, Thomas Graffagnino, Marc Nunkesser:
  Scheduling Additional Trains on Dense Corridors. SEA 2009: 149-160
• 
  Simon Gog:
  Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. SEA 2009: 161-172
• 
  Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner:
  Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. SEA 2009: 173-184
• 
  Lasse Kliemann, Anand Srivastav:
  Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. SEA 2009: 185-196
• 
  Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia:
  Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. SEA 2009: 197-208
• 
  Sylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas:
  Univariate Algebraic Kernel and Application to Arrangements. SEA 2009: 209-220
• 
  José Luis López-Presa, Antonio Fernández Anta:
  Fast Algorithm for Graph Isomorphism Testing. SEA 2009: 221-232
• 
  Hannes Moser, Rolf Niedermeier, Manuel Sorge:
  Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA 2009: 233-244
• 
  Giuseppe Nicosia, Giovanni Stracquadanio:
  A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs. SEA 2009: 245-256
• 
  Andreas Noack, Randolf Rotta:
  Multi-level Algorithms for Modularity Clustering. SEA 2009: 257-268
• 
  Riku Saikkonen, Eljas Soisalon-Soininen:
  Bulk-Insertion Sort: Towards Composite Measures of Presortedness. SEA 2009: 269-280
• 
  Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov:
  Computing Elevation Maxima by Searching the Gauss Sphere. SEA 2009: 281-292
• 
  Jan Vahrenhold:
  Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings. Lecture Notes in Computer Science 5526, Springer 2009, ISBN 978-3-642-02010-0 [contents]