The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 3sum with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1999-2015 (15) 2016-2020 (15) 2021-2023 (15) 2024 (1)
Publication types (Num. hits)
article(23) inproceedings(23)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 12 keywords

Results
Found 46 publication records. Showing 46 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
124Mihai Patrascu Towards polynomial lower bounds for dynamic problems. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF 3SUM, lower bounds, dynamic data structures
102Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF 3sum, wildcard matching, k-mismatches, alignment, run-length encoding
78Ilya Baran, Erik D. Demaine, Mihai Patrascu Subquadratic Algorithms for 3SUM. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 3SUM, Randomization, Word RAM
76Esther Ezra, Micha Sharir Counting and representing intersections among triangles in three dimensions. Search on Bibsonomy SCG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF 3SUM-hard problems, counting intersections, curve-sensitive cuttings, triangles in three dimensions, arrangements
54Timothy M. Chan More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution, and Some Geometric 3SUM-hard Problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
54Timothy M. Chan, Qizheng He Reducing 3SUM to Convolution-3SUM. Search on Bibsonomy SOSA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
54Timothy M. Chan More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
51Virginia Vassilevska, Ryan Williams 0001 Finding, minimizing, and counting weighted subgraphs. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF 3sum, cliques, paths, subgraph isomorphism, weighted graph
51Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi Weak Visibility of Two Objects in Planar Polygonal Scenes. Search on Bibsonomy ICCSA (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF weak visibility, 3sum-hard problems, object inter-visibility, Computational geometry
51Ilya Baran, Erik D. Demaine, Mihai Patrascu Subquadratic Algorithms for 3SUM. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Nick Fischer, Piotr Kaliciak, Adam Polak 0001 Deterministic 3SUM-Hardness. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
27Boris 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. Search on Bibsonomy Comput. Geom. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Nick Fischer, Piotr Kaliciak, Adam Polak 0001 Deterministic 3SUM-Hardness. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Eldon Chung, Kasper Green Larsen Stronger 3SUM-Indexing Lower Bounds. Search on Bibsonomy SODA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Ce Jin 0001, Yinzhan Xu Removing Additive Structure in 3SUM-Based Reductions. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
27Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
27Ce Jin 0001, Yinzhan Xu Removing Additive Structure in 3SUM-Based Reductions. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
27Eldon Chung, Kasper Green Larsen Stronger 3SUM-Indexing Lower Bounds. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
27Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
27Boris 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. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
27Boris 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. Search on Bibsonomy ISAAC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Virginia Vassilevska Williams 3SUM and Related Problems in Fine-Grained Complexity (Invited Talk). Search on Bibsonomy SoCG The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Andrzej Lingas Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. Search on Bibsonomy LAGOS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Esther Ezra On 3SUM-hard Problems in the Decision Tree Model. Search on Bibsonomy CiE The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Andrzej Lingas Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
27Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan Data structures meet cryptography: 3SUM with preprocessing. Search on Bibsonomy STOC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
27Tsvi Kopelowitz, Ely Porat The Strong 3SUM-INDEXING Conjecture is False. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
27Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan 3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
27Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms Encoding 3SUM. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
27Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon Subquadratic Algorithms for Algebraic 3SUM. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
27Ari Freund 0001 Improved Subquadratic 3SUM. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
27Omer Gold, Micha Sharir Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. Search on Bibsonomy ESA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
27Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Search on Bibsonomy SoCG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
27Zahra Jafargholi, Emanuele Viola 3SUM, 3XOR, Triangles. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
27Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
27Tsvi Kopelowitz, Seth Pettie, Ely Porat Higher Lower Bounds from the 3SUM Conjecture. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
27Omer Gold, Micha Sharir Improved Bounds for 3SUM, K-SUM, and Linear Degeneracy. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
27Timothy M. Chan, Moshe Lewenstein Clustered Integer 3SUM via Additive Combinatorics. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
27Timothy M. Chan, Moshe Lewenstein Clustered Integer 3SUM via Additive Combinatorics. Search on Bibsonomy STOC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
27Tsvi Kopelowitz, Seth Pettie, Ely Porat 3SUM Hardness in (Dynamic) Data Structures. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
27Zahra Jafargholi, Emanuele Viola 3SUM, 3XOR, Triangles. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2013 DBLP  BibTeX  RDF
27Zahra Jafargholi, Emanuele Viola 3SUM, 3XOR, Triangles Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
27Gill Barequet, Sariel Har-Peled Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. Search on Bibsonomy Int. J. Comput. Geom. Appl. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Gill Barequet, Sariel Har-Peled Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. Search on Bibsonomy SODA The full citation details ... 1999 DBLP  BibTeX  RDF
Displaying result #1 - #46 of 46 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license