|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 296 occurrences of 167 keywords
|
|
|
Results
Found 501 publication records. Showing 501 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
82 | Satyen Kale, Yuval Peres, C. Seshadhri 0001 |
Noise Tolerance of Expanders and Sublinear Expander Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 719-728, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
81 | Tom Høholdt, Heeralal Janwa |
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings, pp. 53-64, 2009, Springer, 978-3-642-02180-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
eigenvalues of graphs, finite geometries, LDPC and expander codes, Bipartite graphs, expander graphs, Ramanujan graphs, BIBD |
76 | Alexander Gamburd, Igor Pak |
Expansion of product replacement graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 691-696, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
75 | Denis Xavier Charles, Kristin E. Lauter, Eyal Z. Goren |
Cryptographic Hash Functions from Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 22(1), pp. 93-113, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Supersingular elliptic curves, Elliptic curve cryptography, Expander graphs, Cryptographic hash functions, Ramanujan graphs, Isogenies |
75 | Debdeep Mukhopadhyay, Dipanwita Roy Chowdhury |
Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACRI ![In: Cellular Automata, 7th International Conference on Cellular Automata, for Research and Industry, ACRI 2006, Perpignan, France, September 20-23, 2006, Proceedings, pp. 636-645, 2006, Springer, 3-540-40929-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Security, Efficiency, Cellular Automata, Expander Graphs, One-way functions |
69 | Alexander Barg, Gilles Zémor |
Distance properties of expander codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(1), pp. 78-90, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
62 | Yonatan Bilu, Nathan Linial |
Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 404-412, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Lifts of Graphs, Signed Graphs, Expander Graphs, Discrepancy, Lifts |
62 | Heeralal Janwa |
Good Expander Graphs and Expander Codes: Parameters and Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 15th International Symposium, AAECC-15, Toulouse, France, May 12-16, 2003, Proceedings, pp. 119-128, 2003, Springer, 3-540-40111-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
57 | Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann |
Deterministic load balancing and dictionaries in the parallel disk model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 299-307, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
parallel disk model, hashing, dictionary, expander graph, deterministic |
57 | Katalin Friedl, Shi-Chun Tsai |
Recycling random bits in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 14-19, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
pseudo-random bits, block concatenation, random bit recycling, short integers, independently generated bit segments, optimal speedup, parallel algorithms, parallel algorithm, random walk, random number generation, arithmetic, expander graph, randomised algorithms, arithmetic operations |
56 | Dawn Xiaodong Song, J. D. Tygar, David Zuckerman |
Expander Graphs for Digital Stream Authentication and Robust Overlay Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
S&P ![In: 2002 IEEE Symposium on Security and Privacy, Berkeley, California, USA, May 12-15, 2002, pp. 258-270, 2002, IEEE Computer Society, 0-7695-1543-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Sotiris E. Nikoletseas, Paul G. Spirakis |
Expander Properties in Random Regular Graphs with Edge Faults. ![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. 421-432, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
56 | Michael Sipser, Daniel A. Spielman |
Expander Codes ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 566-576, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
logarithmic time parallel decoding algorithms, expander codes, linear error-correcting codes, linear time sequential decoding algorithms, expander graphs |
51 | Erik Schüler, Adão Antônio de Souza Jr., Luigi Carro |
Spare Parts in Analog Circuits: A Filter Example. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DFT ![In: 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007), 26-28 September 2007, Rome, Italy., pp. 321-329, 2007, IEEE Computer Society, 0-7695-2885-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
50 | Harold N. Gabow |
Using expander graphs to find vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 800-844, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graphs, Expander graphs, vertex connectivity |
44 | Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava |
Twice-ramanujan sparsifiers. ![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. 255-262, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
expander graphs, spectral graph theory |
44 | Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi |
Unique games on expanding constraint graphs are easy: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 21-28, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, semidefinite programming, expander graphs |
44 | Peter Mahlmann, Christian Schindelhauer |
Peer-to-peer networks based on random transformations of connected regular undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 155-164, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
distributed algorithms, peer-to-peer networks, random graphs, expander graphs |
44 | Sanjeev Arora, Satish Rao, Umesh V. Vazirani |
Expander flows, geometric embeddings and graph partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(2), pp. 5:1-5:37, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Graph partitioning, semidefinite programs, multicommodity flows, expanders, expansion, graph separators |
44 | Venkatesan Guruswami |
Guest column: error-correcting codes and expander graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 35(3), pp. 25-41, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Sanjeev Arora, Satish Rao, Umesh V. Vazirani |
Expander flows, geometric embeddings and graph partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 222-231, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Shimon Even, Ami Litman |
A Unified Scheme for Routing in Expander Based Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings, pp. 125-135, 1994, Springer, 3-540-57811-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
38 | Shlomi Dolev, Nir Tzachar |
Spanders: distributed spanning expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1309-1314, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
self-orgenization, self-stabilization, expanders |
38 | Alessandro Warth, Milan Stanojevic, Todd D. Millstein |
Statically scoped object adaptation with expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2006, October 22-26, 2006, Portland, Oregon, USA, pp. 37-56, 2006, ACM, 1-59593-348-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
object adaptation, expanders, modular typechecking |
38 | Michael K. Reiter, Asad Samar, Chenxi Wang |
Distributed Construction of a Fault-Tolerant Network from a Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005),26-28 October 2005, Orlando, FL, USA, pp. 155-165, 2005, IEEE Computer Society, 0-7695-2463-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Harold N. Gabow |
Using Expander Graphs to Find Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 410-420, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
nesting properties, separation triples, computational complexity, complexity, graph theory, expander graphs, undirected graph, digraph, time bound, vertex connectivity |
37 | Jon M. Kleinberg, Ronitt Rubinfeld |
Short Paths in Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 86-95, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
inter-connection networks, disjoint paths problem, graph minor containment, polylogarithmic approximation, routing algorithms, greedy algorithm, network routing, multicommodity flow, expander graphs |
37 | David Gillman |
A Chernoff bound for random walks on expander graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 680-691, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Ising system, finite random walk, entropy, random walks, expander graphs, weighted graph, error probability, partition function, Chernoff bound |
32 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(4), pp. 20:1-20:34, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
error-correcting codes, Expander graphs, condensers, list decoding, randomness extractors |
32 | Juan A. Garay, Rafail Ostrovsky |
Almost-Everywhere Secure Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings, pp. 307-323, 2008, Springer, 978-3-540-78966-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
secure message transmission, almost-everywhere agreement, bounded-degree networks, Secure multi-party computation, expander graphs |
32 | Avraham Ben-Aroya, Amnon Ta-Shma |
A combinatorial construction of almost-ramanujan graphs using the zig-zag product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 325-334, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
zig-zag product, expander graphs |
32 | Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan |
MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2007, The Cryptographers' Track at the RSA Conference 2007, San Francisco, CA, USA, February 5-9, 2007, Proceedings, pp. 1-19, 2007, Springer, 3-540-69327-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cryptanalysis, stream cipher, random walks, expander graph |
32 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 96-108, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
error-correcting codes, expander graphs, condensers, list decoding, randomness extractors |
32 | Stephen D. Miller, Ramarathnam Venkatesan |
Spectral Analysis of Pollard Rho Collisions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, pp. 573-581, 2006, Springer, 3-540-36075-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Pollard Rho algorithm, collision time, random walk, spectral analysis, discrete logarithm, expander graph, mixing time |
32 | Peter Mahlmann, Christian Schindelhauer |
Distributed random digraph transformations for peer-to-peer networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 308-317, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
distributed algorithms, peer-to-peer networks, random graphs, expander graphs |
32 | Venkatesan Guruswami |
Better extractors for better codes? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 436-444, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
error-correcting codes, expander graphs, pseudorandomness, list decoding, randomness extractors |
32 | Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Randomness Conductors and Constant-Degree Lossless Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 15, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
expander graphs, extractors, condensers, graph products |
32 | Eero Lassila |
A Macro Expansion Approach to Embedded Processor Code Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 22rd EUROMICRO Conference '96, Beyond 2000: Hardware and Software Design Strategies, September 2-5, 1996, Prague, Czech Republic, pp. 136-142, 1996, IEEE Computer Society, 0-8186-7487-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
macro expansion approach, embedded processor code generation, embedded special-purpose processors, retargetable assembly-code-level macro expander, program flow analysis, hierarchical macro libraries, compiler writer, assembly language programmer, computer architecture |
31 | Sumit Ganguly |
Data Stream Algorithms via Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 52-63, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Tom Høholdt |
Codes from Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMCTA ![In: Coding Theory and Applications, Second International Castle Meeting, ICMCTA 2008, Castillo de la Mota, Medina del Campo, Spain, September 15-19, 2008. Proceedings, pp. 80-81, 2008, Springer, 978-3-540-87447-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Eran Rom, Amnon Ta-Shma |
Improving the Alphabet-Size in Expander-Based Code Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3695-3700, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Alexei E. Ashikhmin, Vitaly Skachek |
Decoding of Expander Codes at Rates Close to Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(12), pp. 5475-5485, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Ron M. Roth, Vitaly Skachek |
Improved Nearly-MDS Expander Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3650-3661, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Jin-yi Cai |
Essentially Every Unimodular Matrix Defines an Expander. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(2), pp. 105-135, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Jin-yi Cai |
Essentially Every Unimodular Matrix Defines and Expander. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 2-22, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
31 | Alan M. Frieze |
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 1-14, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Matthew J. Katz, Micha Sharir |
An Expander-Based Approach to Geometric Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 198-207, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
25 | Navin Goyal, Luis Rademacher, Santosh S. Vempala |
Expanders via random spanning trees. ![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. 576-585, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Alexander Healy |
Randomness-Efficient Sampling within NC1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(1), pp. 3-37, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q15, 68R10, Subject classification. 68Q10 |
25 | Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom |
On the Query Complexity of Testing Orientations for Being Eulerian. ![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. 402-415, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Moni Naor, Udi Wieder |
Novel architectures for P2P applications: The continuous-discrete approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(3), pp. 34, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
routing, Peer-to-peer networks |
25 | Shishir Nagaraja |
Anonymity in the Wild: Mixes on Unstructured Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Privacy Enhancing Technologies ![In: Privacy Enhancing Technologies, 7th International Symposium, PET 2007 Ottawa, Canada, June 20-22, 2007, Revised Selected Papers, pp. 254-271, 2007, Springer, 978-3-540-75550-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Yonatan Bilu, Nathan Linial |
Lifts, Discrepancy and Nearly Optimal Spectral Gap*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(5), pp. 495-519, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C22, 05C35, 05C80, 05C50 |
25 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa |
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 1038-1044, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Alexander Healy |
Randomness-Efficient Sampling Within NC1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 398-409, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Jon Feldman, Clifford Stein 0001 |
LP decoding achieves capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 460-469, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
25 | Avi Wigderson, David Xiao |
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 397-406, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Sanjeev Arora, Elad Hazan, Satyen Kale |
0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 238-247, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Moni Naor, Udi Wieder |
Novel architectures for P2P applications: the continuous-discrete approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 50-59, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
fault tolerance, distributed systems, peer-to-peer, hash tables |
25 | Eli Ben-Sasson |
Hard examples for the bounded depth Frege proof system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 11(3-4), pp. 109-136, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03F20 |
25 | Anna Östlin, Rasmus Pagh |
One-Probe Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 439-450, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Eli Ben-Sasson |
Hard examples for bounded depth frege. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 563-572, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | K. V. M. Naidu, H. Ramesh |
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 301-310, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 42-51, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Uwe Schöning |
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, pp. 110-116, 1997, Springer, 3-540-63437-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
25 | Maher E. Rizkalla, Richard L. Aldridge, Nadeem A. Khan, Harry C. Gundrum |
A CMOS VLSI Implementation of an NxN Multiplexing Circuitry for ATM Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 6th Great Lakes Symposium on VLSI (GLS-VLSI '96), March 22-23, 1996, Ames, IA, USA, pp. 256-259, 1996, IEEE Computer Society, 0-8186-7502-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Thomas H. Spencer |
Parallel matching on expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 752-758, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Thomas Sauerwald |
Expansion and the cover time of parallel random walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 315-324, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
random walks, expander, expansion, cover time |
19 | Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski |
Meeting the deadline: on the complexity of fault-tolerant continuous gossip. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 247-256, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
crashes and restarts, dynamic rumor injection, gossip, expander graphs |
19 | Tal Moran, Ronen Shaltiel, Amnon Ta-Shma |
Non-interactive Timestamping in the Bounded-Storage Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 22(2), pp. 189-226, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Unbalanced expander graphs, Timestamping, Randomness extractors, Bounded-storage model |
19 | Bernard Chazelle, Wolfgang Johann Heinrich Mulzer |
Markov incremental constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 156-163, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clarkson-shor bound, randomized incremental constructions, expander graphs |
19 | David P. Woodruff |
Revisiting the Efficiency of Malicious Two-Party Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings, pp. 79-96, 2007, Springer, 978-3-540-72539-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
malicious model, efficiency, expander graphs, secure function evaluation |
19 | James Aspnes, Navin Rustagi, Jared Saia |
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007. Proceedings, pp. 443-456, 2007, Springer, 978-3-540-77095-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Self-certifying alert, epidemic processes, peer-to-peer, overlay network, worm, expander graphs |
19 | Laurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, Ayalvadi J. Ganesh |
Peer counting and sampling in overlay networks: random walk methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 123-132, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
sampling, random walks, peer-to-peer systems, expander graphs |
19 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom walks on regular digraphs and the RL vs. L problem. ![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. 457-466, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation |
19 | Bogdan S. Chlebus, Dariusz R. Kowalski |
Cooperative asynchronous update of shared memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 733-739, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
problem Write-All, read and write register, work efficiency, distributed algorithm, expander, asynchrony, disperser |
19 | Chi-Jen Lu |
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 17(1), pp. 27-42, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Everlasting security, List-decodable codes, Expander graphs, Randomness extractors, Bounded-storage model |
19 | Salil P. Vadhan |
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 17(1), pp. 43-77, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Everlasting security, Space-bounded adversaries, Averaging samplers, Expander graphs, Extractors, Unconditional security, Bounded-storage model |
19 | Bogdan S. Chlebus, Dariusz R. Kowalski |
A better wake-up in radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 266-274, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
radio synchronizer, wake-up problem, ad-hoc network, synchronization, leader election, expander, multi-hop radio network |
19 | Venkatesan Guruswami, Piotr Indyk |
Linear time encodable and list decodable codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 126-135, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
adversarial noise model, linear time computation, expander graphs, list decoding, spectral partitioning |
19 | Toshinori Yamada, Shuichi Ueno |
Optimal fault-tolerant linear arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 60-64, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
fault-tolerant graph, magnifier, expander, linear array |
19 | Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Randomness conductors and constant-degree lossless expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 659-668, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
expander graphs, extractors, condensers, graph products |
19 | Ziv Bar-Yossef, Oded Goldreich 0001, Avi Wigderson |
Deterministic Amplification of Space-Bounded Probabilistic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 188-, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
space bounded randomized computation, deterministic amplification, expander graphs |
19 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou |
Explicit OR-Dispersers with Polylogarithmic Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(1), pp. 123-154, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
hashing lemmas, imperfect sources of randomness, measures of information, hardness of approximation, derandomization, expander graphs, time-space tradeoffs, pseudo-random generators, explicit constructions, randomized computation |
19 | Dima Grigoriev |
Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 648-652, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Nullstellensatz proofs, Tseitin's tautologies, lower bounds, expander |
19 | Nabil Kahalé |
Eigenvalues and Expansion of Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(5), pp. 1091-1106, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs |
19 | Aravind Srinivasan, David Zuckerman |
Computing with Very Weak Random Sources ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 264-275, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
randomness-efficient Leftover Hash Lemma, very weak random sources, RP algorithms simulation, R-bit string, BPP simulations, Chor-Goldreich sources, expander constructions, probability, hardness, time-space tradeoffs, min-entropy |
19 | Andrei Z. Broder, Anna R. Karlin |
Bounds on the Cover Time (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 479-487, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
regular expander graphs, connected unidirected graph, lower bounds, Markov chain, random walk, upper bounds, eigenvalues, vertices, particle, cover time, neighbors |
18 | Mohamad Al Adraa, Chadi Assi, Mohammed Almekhlafi, Maurice Khabbaz, Vladimir Pelekhaty, Michael Y. Frankel |
Comprehensive Performance and Robustness Analysis of Expander-Based Data Centers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Netw. Serv. Manag. ![In: IEEE Trans. Netw. Serv. Manag. 21(1), pp. 670-683, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Oded Goldreich 0001 |
On locally-characterized expander graphs (a survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR24, pp. TR24-013, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
18 | Silas Richelson, Sourya Roy |
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 70(2), pp. 1040-1049, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Amir Abboud, Nathan Wallheimer |
Worst-Case to Expander-Case Reductions: Derandomized and Generalized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.08394, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Aurelio L. Sulser, Maximilian Probst Gutenberg |
A Simple and Near-Optimal Algorithm for Directed Expander Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.04542, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Kyungsan Kim, Hyunseok Kim, Jinin So, Wonjae Lee, Junhyuk Im, Sungjoo Park, Jeonghyeon Cho, Hoyoung Song |
SMT: Software-Defined Memory Tiering for Heterogeneous Computing Systems With CXL Memory Expander. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Micro ![In: IEEE Micro 43(2), pp. 20-29, March - April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek |
Must the Communication Graph of MPC Protocols be an Expander? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 36(3), pp. 20, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Carlos Andrés Mugruza-Vassallo |
A "fractal" expander-compressor-supplier formative research method on array processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Educ. Inf. Technol. ![In: Educ. Inf. Technol. 28(12), pp. 16349-16372, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Xue Chen, Kuan Cheng, Xin Li 0006, Minghui Ouyang |
Improved Decoding of Expander Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 69(6), pp. 3574-3589, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Oindrila Deb, Arpan Mukhopadhyay |
Biased Consensus Dynamics on Regular Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.08344, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Dongrun Cai, Xue Chen, Pan Peng 0001 |
Effective Resistances in Non-Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.01218, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani |
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.02263, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 501 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ >>] |
|