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

• 2024
• 
  Sébastien Collette, John Iacono:
  Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. SODA 2024: 2657-2678
• 
  Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
  A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223
• 2023
• 
  Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
  Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023)
• 
  Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
  Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19(3): 25:1-25:19 (2023)
• 
  Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
  A General Technique for Searching in Implicit Sets via Function Inversion. CoRR abs/2311.12471 (2023)
• 
  Sébastien Collette, John Iacono:
  Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. CoRR abs/2312.04235 (2023)
• 
  Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant:
  Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13(5): 114-135 (2023)
• 2022
• 
  Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
  Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919: 92-102 (2022)
• 
  Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava:
  Locality-of-Reference Optimality of Cache-Oblivious Algorithms. APOCS 2022: 31-45
• 
  Justin Dallant, John Iacono:
  Conditional Lower Bounds for Dynamic Geometric Measure Problems. ESA 2022: 39:1-39:17
• 
  Justin Dallant, John Iacono:
  How Fast Can We Play Tetris Greedily with Rectangular Pieces? FUN 2022: 13:1-13:19
• 
  Rathish Das, John Iacono, Yakov Nekrich:
  External-Memory Dictionaries with Worst-Case Update Cost. ISAAC 2022: 21:1-21:13
• 
  Justin Dallant, John Iacono:
  How Fast Can We Play Tetris Greedily With Rectangular Pieces? CoRR abs/2202.10771 (2022)
• 
  Rathish Das, John Iacono, Yakov Nekrich:
  External-memory dictionaries with worst-case update cost. CoRR abs/2211.06044 (2022)
• 2021
• 
  Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
  Belga B-Trees. Theory Comput. Syst. 65(3): 541-558 (2021)
• 
  Jean Cardinal, Justin Dallant, John Iacono:
  Approximability of (Simultaneous) Class Cover for Boxes. CCCG 2021: 149-156
• 
  Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
  Fragile Complexity of Adaptive Algorithms. CIAC 2021: 144-157
• 
  Jean Cardinal, Justin Dallant, John Iacono:
  An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA 2021: 24:1-24:14
• 
  Jean Cardinal, John Iacono, Grigorios Koumoutsos:
  Worst-Case Efficient Dynamic Geometric Independent Set. ESA 2021: 25:1-25:15
• 
  Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
  Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC 2021: 3:1-3:15
• 
  Jean Cardinal, John Iacono:
  Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. SOSA 2021: 45-56
• 
  Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
  Fragile Complexity of Adaptive Algorithms. CoRR abs/2102.00338 (2021)
• 
  Jean Cardinal, Justin Dallant, John Iacono:
  An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR abs/2106.05638 (2021)
• 
  Jean Cardinal, Justin Dallant, John Iacono:
  Approximability of (Simultaneous) Class Cover for Boxes. CoRR abs/2106.12969 (2021)
• 
  Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono:
  Dynamic Schnyder Woods. CoRR abs/2106.14451 (2021)
• 
  Jean Cardinal, John Iacono, Grigorios Koumoutsos:
  Worst-Case Efficient Dynamic Geometric Independent Set. CoRR abs/2108.08050 (2021)
• 
  Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
  Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR abs/2109.07587 (2021)
• 
  Justin Dallant, John Iacono:
  Conditional Lower Bounds for Dynamic Geometric Measure Problems. CoRR abs/2112.10095 (2021)
• 
  Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran:
  Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports 11(1): 1-23 (2021)
• 2020
• 
  Mirela Damian, John Iacono, Andrew Winslow:
  Spanning Properties of Theta-Theta-6. Graphs Comb. 36(3): 525-538 (2020)

skipping 151 more matches