The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase sub-polynomial (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1995-2013 (15) 2014-2021 (8)
Publication types (Num. hits)
article(9) inproceedings(13) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 9 keywords

Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
30Jiejun Kong, Xiaoyan Hong, Mario Gerla Modeling Ad-hoc rushing attack in a negligibility-based security framework. Search on Bibsonomy Workshop on Wireless Security The full citation details ... 2006 DBLP  DOI  BibTeX  RDF asymptotic invariant, neg-ligibility, randomized network algorithms, randomized turing machine, sub-polynomial, scalability
15Harry Buhrman, Montserrat Hermo On the Sparse Set Conjecture for Sets with Low Denisty. Search on Bibsonomy STACS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
14Negev Shekel Nosatzki Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
14Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
14Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Search on Bibsonomy STOC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
14Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2015 DBLP  BibTeX  RDF
14Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
14Zeev Dvir, Sivakanth Gopi 2-Server PIR with Sub-Polynomial Communication. Search on Bibsonomy STOC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
14Zeev Dvir, Sivakanth Gopi 2-Server PIR with sub-polynomial communication. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2014 DBLP  BibTeX  RDF
14Zeev Dvir, Sivakanth Gopi 2-Server PIR with sub-polynomial communication. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
14Clément Aubert Linear Logic and Sub-polynomial Classes of Complexity. (Logique linéaire et classes de complexité sous-polynomiales). Search on Bibsonomy 2013   RDF
14Ronen Shaltiel Dispersers for affine sources with sub-polynomial entropy. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2011 DBLP  BibTeX  RDF
14Ronen Shaltiel Dispersers for Affine Sources with Sub-polynomial Entropy. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
14Boaz Barak, Anup Rao 0001, Ronen Shaltiel, Avi Wigderson 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF independent sources, extractors, dispersers, Ramsey graphs
14Vince Grolmusz Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2002 DBLP  BibTeX  RDF
12Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee Optimal Cryptographic Hardness of Learning Monotone Functions. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Jiejun Kong, Dapeng Wu 0001, Xiaoyan Hong, Mario Gerla Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes. Search on Bibsonomy SASN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF ANODR, identity-free routing, motion-MIX, mobility, anonymity
9Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton Semi-oblivious routing: lower bounds. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
6Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot Local Computation of Nearly Additive Spanners. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
6Alexandr Andoni, Krzysztof Onak Approximating edit distance in near-linear time. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, edit distance, metric embeddings
6Jiejun Kong, Xiaoyan Hong, Dapeng Wu 0001, Mario Gerla Complexity-theoretic Modeling of Biological Cyanide Poisoning as Security Attack in Self-organizing Networks. Search on Bibsonomy BIBE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
6Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson Reducing The Seed Length In The Nisan-Wigderson Generator. Search on Bibsonomy Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68Q15
6Harry Buhrman, Luc Longpré Compressibility and Resource Bounded Measure. Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #23 of 23 (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