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

• 2021
• 
  Markus Anders, Pascal Schweitzer, Florian Wetzels:
  Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. ICALP 2021: 15:1-15:15
• 
  Markus Anders, Pascal Schweitzer, Florian Wetzels:
  Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. CoRR abs/2103.10244 (2021)
• 2020
• 
  Rong Ge, Ankur Moitra:
  Topic Models and Nonnegative Matrix Factorization. Beyond the Worst-Case Analysis of Algorithms 2020: 445-464
• 
  Maria-Florina Balcan:
  Data-Driven Algorithm Design. Beyond the Worst-Case Analysis of Algorithms 2020: 626-645
• 
  Maria-Florina Balcan, Nika Haghtalab:
  Noise in Classification. Beyond the Worst-Case Analysis of Algorithms 2020: 361-381
• 
  Jérémy Barbay:
  From Adaptive Analysis to Instance Optimality. Beyond the Worst-Case Analysis of Algorithms 2020: 52-71
• 
  Avrim Blum:
  Approximation Stability and Proxy Objectives. Beyond the Worst-Case Analysis of Algorithms 2020: 120-139
• 
  Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
  When Simple Hash Functions Suffice. Beyond the Worst-Case Analysis of Algorithms 2020: 567-585
• 
  Daniel Dadush, Sophie Huiberts:
  Smoothed Analysis of the Simplex Method. Beyond the Worst-Case Analysis of Algorithms 2020: 309-333
• 
  Sanjoy Dasgupta, Samory Kpotufe:
  Nearest Neighbor Classification and Search. Beyond the Worst-Case Analysis of Algorithms 2020: 403-423
• 
  Ilias Diakonikolas, Daniel M. Kane:
  Robust High-Dimensional Statistics. Beyond the Worst-Case Analysis of Algorithms 2020: 382-402
• 
  Uriel Feige:
  Introduction to Semirandom Models. Beyond the Worst-Case Analysis of Algorithms 2020: 189-211
• 
  Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
  Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms 2020: 27-51
• 
  Vijay Ganesh, Moshe Y. Vardi:
  On the Unreasonable Effectiveness of SAT Solvers. Beyond the Worst-Case Analysis of Algorithms 2020: 547-566
• 
  Anupam Gupta, Sahil Singla:
  Random-Order Models. Beyond the Worst-Case Analysis of Algorithms 2020: 234-258
• 
  Moritz Hardt:
  Generalization in Overparameterized Models. Beyond the Worst-Case Analysis of Algorithms 2020: 486-505
• 
  Anna R. Karlin, Elias Koutsoupias:
  Beyond Competitive Analysis. Beyond the Worst-Case Analysis of Algorithms 2020: 529-546
• 
  Tengyu Ma:
  Why Do Local Methods Solve Nonconvex Problems? Beyond the Worst-Case Analysis of Algorithms 2020: 465-485
• 
  Konstantin Makarychev, Yury Makarychev:
  Perturbation Resilience. Beyond the Worst-Case Analysis of Algorithms 2020: 95-119
• 
  Bodo Manthey:
  Smoothed Analysis of Local Search. Beyond the Worst-Case Analysis of Algorithms 2020: 285-308
• 
  Michael Mitzenmacher, Sergei Vassilvitskii:
  Algorithms with Predictions. Beyond the Worst-Case Analysis of Algorithms 2020: 646-662
• 
  Ankur Moitra:
  Semirandom Stochastic Block Models. Beyond the Worst-Case Analysis of Algorithms 2020: 212-233
• 
  Eric Price:
  Sparse Recovery. Beyond the Worst-Case Analysis of Algorithms 2020: 140-164
• 
  Heiko Röglin:
  Smoothed Analysis of Pareto Curves in Multiobjective Optimization. Beyond the Worst-Case Analysis of Algorithms 2020: 334-358
• 
  Tim Roughgarden:
  Introduction. Beyond the Worst-Case Analysis of Algorithms 2020: 1-24
• 
  Tim Roughgarden:
  Resource Augmentation. Beyond the Worst-Case Analysis of Algorithms 2020: 72-92
• 
  Tim Roughgarden:
  Distributional Analysis. Beyond the Worst-Case Analysis of Algorithms 2020: 167-188
• 
  Tim Roughgarden, C. Seshadhri:
  Distribution-Free Models of Social Networks. Beyond the Worst-Case Analysis of Algorithms 2020: 606-625
• 
  C. Seshadhri:
  Self-Improving Algorithms. Beyond the Worst-Case Analysis of Algorithms 2020: 259-282
• 
  Inbal Talgam-Cohen:
  Prior-Independent Auctions. Beyond the Worst-Case Analysis of Algorithms 2020: 586-605

skipping 5 more matches