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

• 2012
• 
  Valentin V. Andreev, Timothy H. McNicholl:
  Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains. Theory Comput. Syst. 50(2): 354-369 (2012)
• 
  Tetsuo Asano:
  In-place Algorithm for Erasing a Connected Component in a Binary Image. Theory Comput. Syst. 50(1): 111-123 (2012)
• 
  Jan A. Bergstra, Inge Bethke:
  On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. Theory Comput. Syst. 50(4): 706-720 (2012)
• 
  Jan A. Bergstra, Cornelis A. Middelburg:
  On the Expressiveness of Single-Pass Instruction Sequences. Theory Comput. Syst. 50(2): 313-328 (2012)
• 
  Michal Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche:
  The Navigational Power of Web Browsers. Theory Comput. Syst. 50(2): 213-240 (2012)
• 
  Philip Bille:
  Faster Approximate String Matching for Short Patterns. Theory Comput. Syst. 50(3): 492-515 (2012)
• 
  Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
  A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012)
• 
  Paolo Boldi, Luisa Gargano:
  Special Issue on Fun with Algorithms. Theory Comput. Syst. 50(1): 1-2 (2012)
• 
  Simone Bova, Hubie Chen, Matthew Valeriote:
  On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Theory Comput. Syst. 50(2): 329-353 (2012)
• 
  Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
  On Approximate Jumbled Pattern Matching in Strings. Theory Comput. Syst. 50(1): 35-51 (2012)
• 
  Mark Burgin, Bidyut Gupta:
  Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems. Theory Comput. Syst. 50(4): 694-705 (2012)
• 
  Shukai Cai, Taisuke Izumi, Koichi Wada:
  How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. Theory Comput. Syst. 50(3): 433-445 (2012)
• 
  Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou:
  The Efficiency of Fair Division. Theory Comput. Syst. 50(4): 589-610 (2012)
• 
  M. A. Cerdà-Uguet, Michel P. Schellekens, Óscar Valero:
  The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science. Theory Comput. Syst. 50(2): 387-399 (2012)
• 
  Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
  The Complexity of Flood Filling Games. Theory Comput. Syst. 50(1): 72-92 (2012)
• 
  P. J. Couch, Bobby Dale Daniel, Timothy H. McNicholl:
  Computing Space-Filling Curves. Theory Comput. Syst. 50(2): 370-386 (2012)
• 
  Dale Daniel, Timothy H. McNicholl:
  Effective Versions of Local Connectivity Properties. Theory Comput. Syst. 50(4): 621-640 (2012)
• 
  Arnaud Durand, Miki Hermann, Gustav Nordh:
  Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50(3): 446-491 (2012)
• 
  Amr Elmasry, Claus Jensen, Jyrki Katajainen:
  Two Skew-Binary Numeral Systems and One Application. Theory Comput. Syst. 50(1): 185-211 (2012)
• 
  Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
  Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012)
• 
  Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
  Searching for Black Holes in Subways. Theory Comput. Syst. 50(1): 158-184 (2012)
• 
  Riccardo Focardi, Flaminia L. Luccio:
  Guessing Bank PINs by Winning a Mastermind Game. Theory Comput. Syst. 50(1): 52-71 (2012)
• 
  Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
  Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012)
• 
  Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis:
  The Impact of Social Ignorance on Weighted Congestion Games. Theory Comput. Syst. 50(3): 559-578 (2012)
• 
  Zoltán Fülöp, Torsten Stüber, Heiko Vogler:
  A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. Theory Comput. Syst. 50(2): 241-278 (2012)
• 
  Anna Gál, Vladimir Trifonov:
  On the Correlation Between Parity and Modular Polynomials. Theory Comput. Syst. 50(3): 516-536 (2012)
• 
  Hossein Ghasemalizadeh, Mohammadreza Razzazi:
  An Improved Approximation Algorithm for the Most Points Covering Problem. Theory Comput. Syst. 50(3): 545-558 (2012)
• 
  Arpita Ghosh, Mohammad Mahdian:
  Christmas Gift Exchange Games. Theory Comput. Syst. 50(1): 3-19 (2012)
• 
  Khandoker Mohammed Mominul Haque:
  Irregular Total Labellings of Generalized Petersen Graphs. Theory Comput. Syst. 50(3): 537-544 (2012)
• 
  Ruo-Wei Hung:
  Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. Theory Comput. Syst. 50(4): 721-738 (2012)

skipping 9 more matches