The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "APPROX/RANDOM"( http://dblp.L3S.de/Venues/APPROX/RANDOM )

URL (DBLP): http://dblp.uni-trier.de/db/conf/approx

Publication years (Num. hits)
2022 (56) 2023 (68)
Publication types (Num. hits)
inproceedings(122) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 124 publication records. Showing 124 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang 0001 Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Debarati Das 0001, Barna Saha Approximating LCS and Alignment Distance over Multiple Sequences. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Xuangui Huang, Peter Ivanov, Emanuele Viola Affine Extractors and AC0-Parity. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Joanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, Santhoshini Velusamy On Sketching Approximations for Symmetric Boolean CSPs. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Abhranil Chatterjee 0001, Partha Mukhopadhyay Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sourav Chakraborty 0001, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Daniel A. Spielman, Peng Zhang Hardness Results for Weaver's Discrepancy Problem. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Weiming Feng 0001, Heng Guo 0001, Jiaheng Wang 0002 Improved Bounds for Randomly Colouring Simple Hypergraphs. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Hermish Mehta, Daniel Reichman 0001 Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang Caching with Reserves. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Peter Mörters, Christian Sohler, Stefan Walzer A Sublinear Local Access Implementation for the Chinese Restaurant Process. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Frederick Qiu, Sahil Singla 0001 Submodular Dominance and Applications. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Michael Dinitz, Ama Koranteng, Guy Kortsarz Relative Survivable Network Design. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Kheeran K. Naidu, Vihan Shah Space Optimal Vertex Cover in Dynamic Streams. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Ariel Szarf Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Amit Chakrabarti, Chaitanya Swamy (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  BibTeX  RDF
1Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan 0001, Santhoshini Velusamy Sketching Approximability of (Weak) Monarchy Predicates. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sepideh Mahabadi, David P. Woodruff, Samson Zhou Adaptive Sketches for Robust Regression with Importance Sampling. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Max Klimm, Martin Knaack Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Allan Borodin, Calum MacRury, Akash Rakheja Prophet Matching in the Probe-Commit Model. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Itay Kalev, Amnon Ta-Shma Unbalanced Expanders from Multiplicity Codes. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Simon Apers, Pawel Gawrychowski, Troy Lee Finding the KT Partition of a Weighted Graph in Near-Linear Time. Search on Bibsonomy APPROX/RANDOM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #101 - #124 of 124 (100 per page; Change: )
Pages: [<<][1][2]
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