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

• 2019
• 
  Thomas Watson:
  Amplification with One NP Oracle Query. ICALP 2019: 96:1-96:13
• 
  Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla:
  Non-Clairvoyant Precedence Constrained Scheduling. ICALP 2019: 63:1-63:14
• 
  Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
  Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. ICALP 2019: 21:1-21:15
• 
  Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
  Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. ICALP 2019: 78:1-78:15
• 
  Tobias Friedrich, Ralf Rothenberger:
  The Satisfiability Threshold for Non-Uniform Random 2-SAT. ICALP 2019: 61:1-61:14
• 
  Siddharth Gupta, Adrian Kosowski, Laurent Viennot:
  Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. ICALP 2019: 143:1-143:15
• 
  Zhiyi Huang, Xue Zhu:
  Scalable and Jointly Differentially Private Packing. ICALP 2019: 73:1-73:12
• 
  Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, Elham Kashefi:
  Complexity-Theoretic Limitations on Blind Delegated Quantum Computation. ICALP 2019: 6:1-6:13
• 
  Amir Abboud:
  Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. ICALP 2019: 8:1-8:13
• 
  Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf:
  Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP 2019: 7:1-7:15
• 
  Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
  Geometric Multicut. ICALP 2019: 9:1-9:15
• 
  Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen:
  Lower Bounds for Multiplication via Network Coding. ICALP 2019: 10:1-10:12
• 
  Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
  Path Contraction Faster Than 2ⁿ. ICALP 2019: 11:1-11:13
• 
  Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
  How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP 2019: 131:1-131:14
• 
  Noga Alon, Shiri Chechik, Sarel Cohen:
  Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. ICALP 2019: 12:1-12:14
• 
  Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki:
  Stochastic Graph Exploration. ICALP 2019: 136:1-136:14
• 
  Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein:
  Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP 2019: 13:1-13:14
• 
  Alexandr Andoni, Tal Malkin, Negev Shekel Nosatzki:
  Two Party Distribution Testing: Communication and Security. ICALP 2019: 15:1-15:16
• 
  Alexandr Andoni, Clifford Stein, Peilin Zhong:
  Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. ICALP 2019: 14:1-14:16
• 
  Joran van Apeldoorn, András Gilyén:
  Improvements in Quantum SDP-Solving with Applications. ICALP 2019: 99:1-99:15
• 
  Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
  Two New Results About Quantum Exact Learning. ICALP 2019: 16:1-16:15
• 
  Sepehr Assadi, Shay Solomon:
  When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. ICALP 2019: 17:1-17:17
• 
  Pranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan, Colin White, David P. Woodruff:
  Robust Communication-Optimal Distributed Clustering Algorithms. ICALP 2019: 18:1-18:16
• 
  Kyriakos Axiotis, Christos Tzamos:
  Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. ICALP 2019: 19:1-19:13
• 
  Mohamed Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani:
  A Type System for Interactive JSON Schema Inference (Extended Abstract). ICALP 2019: 101:1-101:13
• 
  Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
  On the Complexity of Value Iteration. ICALP 2019: 102:1-102:15
• 
  Pablo Barceló, Diego Figueira, Miguel Romero:
  Boundedness of Conjunctive Regular Path Queries. ICALP 2019: 104:1-104:15
• 
  Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen:
  Monadic Decomposability of Regular Relations. ICALP 2019: 103:1-103:14
• 
  Yair Bartal, Nova Fandina, Ofer Neiman:
  Covering Metric Spaces by Few Trees. ICALP 2019: 20:1-20:16
• 
  Paul C. Bell:
  Polynomially Ambiguous Probabilistic Automata on Restricted Languages. ICALP 2019: 105:1-105:14

skipping 123 more matches

found ?? matches

The Semantic Scholar full-text search requires JavaScript to operate properly. To proceed, please enable JavaScript in your browser settings.

• service temporarily not available

see all matches at semanticscholar.org