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

• 2015
• 
  János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
  Online Results for Black and White Bin Packing. Theory Comput. Syst. 56(1): 137-155 (2015)
• 
  Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
  Some Anomalies of Farsighted Strategic Behavior. Theory Comput. Syst. 56(1): 156-180 (2015)
• 
  Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
  OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56(1): 22-40 (2015)
• 
  Harry Buhrman, Bruno Loff, Leen Torenvliet:
  Hardness of Approximation for Knapsack Problems. Theory Comput. Syst. 56(2): 372-393 (2015)
• 
  Markus Chimani, Joachim Spoerhase:
  Approximating Spanning Trees with Few Branches. Theory Comput. Syst. 56(1): 181-196 (2015)
• 
  Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
  Sitting Closer to Friends than Enemies, Revisited. Theory Comput. Syst. 56(2): 394-405 (2015)
• 
  Evgeny Demenkov, Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin:
  New Lower Bounds on Circuit Size of Multi-output Functions. Theory Comput. Syst. 56(4): 630-642 (2015)
• 
  Volker Diekert, Manfred Kufleitner:
  Omega-Rational Expressions with Bounded Synchronization Delay. Theory Comput. Syst. 56(4): 686-696 (2015)
• 
  Martin Dietzfelbinger, Michael Rink:
  Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs. Theory Comput. Syst. 56(4): 593-611 (2015)
• 
  Stefan Dobrev, Rastislav Královic, Richard Královic:
  Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput. Syst. 56(1): 197-219 (2015)
• 
  Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
  On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. 56(1): 220-250 (2015)
• 
  Tomás Ebenlendr, Jirí Sgall:
  A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption. Theory Comput. Syst. 56(1): 73-81 (2015)
• 
  Leah Epstein, Hanan Zebedat-Haider:
  Rent or Buy Problems with a Fixed Time Horizon. Theory Comput. Syst. 56(2): 309-329 (2015)
• 
  Thomas Erlebach, Giuseppe Persiano:
  Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56(1): 135-136 (2015)
• 
  Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
  New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56(2): 330-346 (2015)
• 
  Santiago Figueira, André Nies:
  Feasible Analysis, Randomness, and Base Invariance. Theory Comput. Syst. 56(3): 439-464 (2015)
• 
  Rolf Harren, Walter Kern:
  Improved Lower Bound for Online Strip Packing. Theory Comput. Syst. 56(1): 41-72 (2015)
• 
  Hiro Ito, Stefan Langerman, Yuichi Yoshida:
  Generalized River Crossing Problems. Theory Comput. Syst. 56(2): 418-435 (2015)
• 
  Christos A. Kapoutsis, Giovanni Pighizzini:
  Two-Way Automata Characterizations of L/poly Versus NL. Theory Comput. Syst. 56(4): 662-685 (2015)
• 
  Prateek Karandikar, Philippe Schnoebelen:
  Generalized Post Embedding Problems. Theory Comput. Syst. 56(4): 697-716 (2015)
• 
  Juhani Karhumäki, Edward A. Hirsch:
  Preface. Theory Comput. Syst. 56(4): 591-592 (2015)
• 
  Christiane Lammersen, Melanie Schmidt, Christian Sohler:
  Probabilistic k-Median Clustering in Data Streams. Theory Comput. Syst. 56(1): 251-290 (2015)
• 
  R. Mareay:
  Topological Approach to Multivalued Information System. Theory Comput. Syst. 56(2): 406-417 (2015)
• 
  Elvira Mayordomo, Wolfgang Merkle:
  Editorial. Theory Comput. Syst. 56(3): 437-438 (2015)
• 
  Kenshi Miyabe:
  Schnorr Triviality and Its Equivalent Notions. Theory Comput. Syst. 56(3): 465-486 (2015)
• 
  Daniil Musatov:
  On Extracting Space-bounded Kolmogorov Complexity. Theory Comput. Syst. 56(4): 643-661 (2015)
• 
  Christopher P. Porter:
  Trivial Measures are not so Trivial. Theory Comput. Syst. 56(3): 487-512 (2015)
• 
  Amir Pourabdollah, Tim J. Brailsford:
  On the Turing Completeness of the Semantic Web. Theory Comput. Syst. 56(2): 291-308 (2015)
• 
  Marc P. Renault, Adi Rosén:
  On Online Algorithms with Advice for the k-Server Problem. Theory Comput. Syst. 56(1): 3-21 (2015)
• 
  Romeo Rizzi, Florian Sikora:
  Some Results on More Flexible Versions of Graph Motif. Theory Comput. Syst. 56(4): 612-629 (2015)

skipping 8 more matches