|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 6 keywords
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
65 | Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht |
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 789-800, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
quasi-random graphs, Laplacian eigenvalues, Grothendieck’s inequality, regularity lemma, sparse graphs |
59 | Ueli M. Maurer |
Indistinguishability of Random Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002, Proceedings, pp. 110-132, 2002, Springer, 3-540-43553-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
random systems, quasi-randomness, Indistinguishability, pseudo-random functions, CBC-MAC, pseudo-random permutations |
57 | Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht |
Hypergraph regularity and quasi-randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 227-235, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Zachary DeStefano, Dani Barrack, Michael Dixon |
zkQMC: Zero-Knowledge Proofs For (Some) Probabilistic Computations Using Quasi-Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1007, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Elad Aigner-Horev, Hiêp Hàn |
Linear quasi-randomness of subsets of abelian groups and hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 88, pp. 103116, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Elad Aigner-Horev, Hiêp Hàn |
Linear quasi-randomness of subsets of abelian groups and hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 61, pp. 21-27, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht |
Weak quasi-randomness for uniform hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 40(1), pp. 1-38, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Hao Huang, Choongbum Lee |
Quasi-randomness of graph balanced cut properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 41(1), pp. 124-145, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Asaf Shapira, Raphael Yuster |
The quasi-randomness of hypergraph cut properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 40(1), pp. 105-131, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Raphael Yuster |
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 30(2), pp. 239-246, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Hao Huang, Choongbum Lee |
Quasi-randomness of graph balanced cut properties ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1009.2307, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
20 | Asaf Shapira, Raphael Yuster |
The effect of induced subgraphs on quasi-randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 36(1), pp. 90-109, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht |
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 39(6), pp. 2336-2362, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Asaf Shapira |
Quasi-randomness and the distribution of copies of a fixed graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(6), pp. 735-745, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Asaf Shapira, Raphael Yuster |
The effect of induced subgraphs on quasi-randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 789-798, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
20 | Raphael Yuster |
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 596-601, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Jozef Skokan, Lubos Thoma |
Bipartite Subgraphs and Quasi-Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(2), pp. 255-262, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan |
Hypergraphs, Quasi-randomness, and Conditions for Regularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 97(2), pp. 307-352, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Fan R. K. Chung, Prasad Tetali |
Communication Complexity and Quasi Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 6(1), pp. 110-123, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
20 | Fan R. K. Chung |
Regularity Lemmas for Hypergraphs and Quasi-randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 2(2), pp. 241-252, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|