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

• 2022
• 
  Madhu Sudan:
  Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk). ICALP 2022: 5:1-5:20
• 
  Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
  Social Distancing Network Creation. ICALP 2022: 62:1-62:21
• 
  Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
  Smoothed Analysis of the Komlós Conjecture. ICALP 2022: 14:1-14:12
• 
  Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar:
  Separations Between Combinatorial Measures for Transitive Functions. ICALP 2022: 36:1-36:20
• 
  Debarati Das, Tomasz Kociumaka, Barna Saha:
  Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. ICALP 2022: 49:1-49:20
• 
  Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese:
  Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. ICALP 2022: 80:1-80:20
• 
  Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger:
  Parameterized Safety Verification of Round-Based Shared-Memory Systems. ICALP 2022: 113:1-113:20
• 
  Amit Deshpande, Rameshwar Pratap:
  One-Pass Additive-Error Subset Selection for ℓ_p Subspace Approximation. ICALP 2022: 51:1-51:14
• 
  Andrew McGregor, Rik Sengupta:
  Graph Reconstruction from Random Subgraphs. ICALP 2022: 96:1-96:18
• 
  Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
  Fully Functional Parameterized Suffix Trees in Compact Space. ICALP 2022: 65:1-65:18
• 
  Akash Kumar, Anand Louis, Rameesh Paul:
  Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs. ICALP 2022: 84:1-84:20
• 
  Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi:
  Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. ICALP 2022: 7:1-7:18
• 
  Shweta Agrawal, Damien Stehlé, Anshu Yadav:
  Round-Optimal Lattice-Based Threshold Signatures, Revisited. ICALP 2022: 8:1-8:20
• 
  Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, Mateusz Skomra:
  Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games. ICALP 2022: 110:1-110:20
• 
  Josh Alman, Dean Hirsch:
  Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior Algebras. ICALP 2022: 9:1-9:19
• 
  Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
  Low-Degree Polynomials Extract From Local Sources. ICALP 2022: 10:1-10:20
• 
  Djamel Eddine Amir, Mathieu Hoyrup:
  Computability of Finite Simplicial Complexes. ICALP 2022: 111:1-111:16
• 
  Sepehr Assadi, Aaron Bernstein, Aditi Dudeja:
  Decremental Matching in General Graphs. ICALP 2022: 11:1-11:19
• 
  Albert Atserias:
  Towards a Theory of Algorithmic Proof Complexity (Invited Talk). ICALP 2022: 1:1-1:2
• 
  Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas:
  Near-Optimal Algorithms for Stochastic Online Bin Packing. ICALP 2022: 12:1-12:20
• 
  Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou:
  Competitive Vertex Recoloring. ICALP 2022: 13:1-13:20
• 
  David Barozzini, Pawel Parys, Jan Wroblewski:
  Unboundedness for Recursion Schemes: A Simpler Type System. ICALP 2022: 112:1-112:19
• 
  Surender Baswana, Koustav Bhanja, Abhyuday Pandey:
  Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. ICALP 2022: 15:1-15:20
• 
  Niel de Beaudrap, Aleks Kissinger, John van de Wetering:
  Circuit Extraction for ZX-Diagrams Can Be #P-Hard. ICALP 2022: 119:1-119:19
• 
  Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
  Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. ICALP 2022: 16:1-16:18
• 
  Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten:
  Finding Monotone Patterns in Sublinear Time, Adaptively. ICALP 2022: 17:1-17:19
• 
  Pierre Bergé, Édouard Bonnet, Hugues Déprés:
  Deciding Twin-Width at Most 4 Is NP-Complete. ICALP 2022: 18:1-18:20
• 
  Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein:
  Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP 2022: 19:1-19:19
• 
  Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
  Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP 2022: 20:1-20:20
• 
  Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
  Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP 2022: 21:1-21:16

skipping 105 more matches