|
|
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 |
30 | Jiejun Kong, Xiaoyan Hong, Mario Gerla |
Modeling Ad-hoc rushing attack in a negligibility-based security framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Wireless Security ![In: Proceedings of the 2006 ACM Workshop on Wireless Security, Los Angeles, California, USA, September 29, 2006, pp. 55-64, 2006, ACM, 1-59593-557-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
asymptotic invariant, neg-ligibility, randomized network algorithms, randomized turing machine, sub-polynomial, scalability |
15 | Harry Buhrman, Montserrat Hermo |
On the Sparse Set Conjecture for Sets with Low Denisty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 609-618, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
14 | Negev Shekel Nosatzki |
Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.08454, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
14 | Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf |
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 64(2), pp. 11:1-11:42, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
14 | Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf |
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pp. 202-215, 2016, ACM, 978-1-4503-4132-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
14 | Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf |
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
14 | Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf |
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1504.05653, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
14 | Zeev Dvir, Sivakanth Gopi |
2-Server PIR with Sub-Polynomial Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pp. 577-584, 2015, ACM, 978-1-4503-3536-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
14 | Zeev Dvir, Sivakanth Gopi |
2-Server PIR with sub-polynomial communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR14, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
14 | Zeev Dvir, Sivakanth Gopi |
2-Server PIR with sub-polynomial communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1407.6692, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
14 | Clément Aubert |
Linear Logic and Sub-polynomial Classes of Complexity. (Logique linéaire et classes de complexité sous-polynomiales). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
14 | Ronen Shaltiel |
Dispersers for affine sources with sub-polynomial entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
14 | Ronen Shaltiel |
Dispersers for Affine Sources with Sub-polynomial Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pp. 247-256, 2011, IEEE Computer Society, 978-1-4577-1843-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Boaz 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](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 671-680, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
independent sources, extractors, dispersers, Ramsey graphs |
14 | Vince Grolmusz |
Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR02, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
12 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee |
Optimal Cryptographic Hardness of Learning Monotone Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 36-47, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Jiejun Kong, Dapeng Wu 0001, Xiaoyan Hong, Mario Gerla |
Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SASN ![In: Proceedings of the 3rd ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2005, Alexandria, VA, USA, November 7, 2005, pp. 97-106, 2005, ACM, 1-59593-227-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
ANODR, identity-free routing, motion-MIX, mobility, anonymity |
9 | Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton |
Semi-oblivious routing: lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 929-938, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
6 | Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot |
Local Computation of Nearly Additive Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 176-190, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Alexandr Andoni, Krzysztof Onak |
Approximating edit distance in near-linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 199-204, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, edit distance, metric embeddings |
6 | Jiejun 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](Pics/bibsonomy.png) |
BIBE ![In: Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2007, October 14-17, 2007, Harvard Medical School, Boston, MA, USA, pp. 914-921, 2007, IEEE Computer Society, 978-1-4244-1509-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
6 | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
Reducing The Seed Length In The Nisan-Wigderson Generator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(6), pp. 647-681, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q15 |
6 | Harry Buhrman, Luc Longpré |
Compressibility and Resource Bounded Measure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 13-24, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|