Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Stasys Jukna |
Expanders and time-restricted branching programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
19 | Zeph Landau, Alexander Russell |
Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 11(1), 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Roy Meshulam, Avi Wigderson |
Expanders In Group Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(4), pp. 659-680, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C25, 20C15 |
19 | Tullio Ceccherini-Silberstein, Fabio Scarabotti, Filippo Tolli |
Weighted expanders and the anisotropic Alon-Boppana theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 25(5), pp. 735-744, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Heeralal Janwa, Arbind K. Lal |
On Expanders Graphs: Parameters and Applications ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.IT/0406048, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
19 | Eyal Rozenman |
Expanders, lifts and isoperimetric inequalities (גרפים מרחיבים, הרמות של גרפים ובעיות איזופרימטריות.). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2004 |
RDF |
|
19 | Roy Meshulam, Avi Wigderson |
Expanders from Symmetric Codes. ![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. 16, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR01, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
19 | Amnon Ta-Shma, Christopher Umans, David Zuckerman |
Loss-less condensers, unbalanced expanders, and extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 143-152, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Marci J. Gambrell |
Vertex-neighbor-integrity of magnifiers, expanders, and hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 216(1-3), pp. 257-266, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Uwe Schöning |
Construction of expanders and superconcentrators using Kolmogorov complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 17(1), pp. 64-77, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Nathan Linial, Avner Magen |
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 79(2), pp. 157-171, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Avi Wigderson, David Zuckerman |
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(1), pp. 125-138, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Igor Pak |
Random Cayley Graphs with O(log[G]) Generators Are Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, pp. 521-526, 1999, Springer, 3-540-66251-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | William E. Ham |
Recent Advances in Basic Physical Technology for Parallel SCSI: UltraSCSI, Expanders, Interconnect, and Hot Plugging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digit. Tech. J. ![In: Digit. Tech. J. 9(3), 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
19 | Uwe Schöning |
Better Expanders and Superconcentrators by Kolmogorov Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997, pp. 138-150, 1997, Carleton Scientific. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
19 | Matthew J. Katz |
Improved Algorithms in Geometric Optimization via Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Third Israel Symposium on Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings, pp. 78-87, 1995, IEEE Computer Society, 0-8186-6915-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Nikolai N. Kuzjurin |
Multi-Processor Scheduling and Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 51(6), pp. 315-319, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Miklós Ajtai |
Recursive Construction for 3-Regular Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 14(4), pp. 379-416, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon, Yuval Roichman |
Random Cayley Graphs and Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 5(2), pp. 271-285, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Frederic T. Chong, Eric A. Brewer, Frank Thomson Leighton, Thomas F. Knight Jr. |
Packaging and Multiplexing of Hierarchical Scalable Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PCRCW ![In: Parallel Computer Routing and Communication, First International Workshop, PCRCW'94, Seattle, Washington, USA, May 16-18, 1994, Proceedings, pp. 200-214, 1994, Springer, 3-540-58429-3. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Eric A. Brewer, Frederic T. Chong, Tom Leighton |
Scalable expanders: exploiting hierarchical random wiring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pp. 144-152, 1994, ACM, 0-89791-663-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Matthew J. Katz |
Geometric optimization via expanders and visibility of fat objects in three dimensions: two studies in computational geometry ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1994 |
RDF |
|
19 | Matthew J. Katz, Micha Sharir |
Optimal Slope Selection via Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 47(3), pp. 115-122, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Matthew J. Katz, Micha Sharir |
Optimal Slope Selection Via Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993, pp. 139-144, 1993, University of Waterloo. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
19 | Avi Wigderson, David Zuckerman |
Expanders that beat the eigenvalue bound: explicit construction and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 245-251, 1993, ACM, 0-89791-591-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon, Yuval Roichman |
Random Cayley Graphs and Expanders (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 1-3, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Alexander Lubotzky, Benjamin Weiss 0002 |
Groups and Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 95-109, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | 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 | Andrew Thomason 0001 |
Dense expanders and pseudo-random bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 75(1-3), pp. 381-386, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
19 | Frank Thomson Leighton, Bruce M. Maggs |
Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 384-389, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
multibutterflies, routing packets, robust, switching network, distributed-memory machine, high-bandwidth |
19 | Michael Sipser |
Expanders, Randomness, or Time versus Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 36(3), pp. 379-383, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
19 | Shuji Jimbo, Akira Maruoka |
Expanders obtained from affine transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 7(4), pp. 343-355, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon, Zvi Galil, V. D. Milman |
Better Expanders and Superconcentrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 8(3), pp. 337-347, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Miklós Ajtai |
Recursive Construction for 3-Regular Expanders ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987, pp. 295-304, 1987, IEEE Computer Society, 0-8186-0807-2. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon |
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 6(3), pp. 207-219, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon |
Eigenvalues and expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 6(2), pp. 83-96, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Alexander Lubotzky, Ralph Phillips, Peter Sarnak |
Explicit Expanders and the Ramanujan Conjectures ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA, pp. 240-246, 1986, ACM, 0-89791-193-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Michael Sipser |
Expanders, Randomness, or Time versus Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, USA, June 2-5, 1986, pp. 325-329, 1986, Springer, 3-540-16486-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Shuji Jimbo, Akira Maruoka |
Expanders Obtained from Affine Transformations (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA, pp. 88-97, 1985, ACM. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon |
Expanders, Sorting in Rounds and Superconcentrators of Limited Depth ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA, pp. 98-102, 1985, ACM. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon, V. D. Milman |
Eigenvalues, Expanders and Superconcentrators (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, Florida, USA, 24-26 October 1984, pp. 320-322, 1984, IEEE Computer Society, 0-8186-0591-X. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
19 | Eli Shamir 0001 |
From Expanders to Better Superconcentrators without Cascading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings, pp. 121-128, 1984, Springer, 3-540-12920-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
15 | Sanjeev Arora, David Steurer, Avi Wigderson |
Towards a Study of Low-Complexity Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 119-131, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Robert Elsässer, Thomas Sauerwald |
Tight Bounds for the Cover Time of Multiple Random Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 415-426, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Tobias Friedrich 0001, Thomas Sauerwald |
Near-perfect load balancing by randomized rounding. ![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. 121-130, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
load balancing, randomized rounding |
15 | 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 |
15 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification via Space-Efficient Direct Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(4), pp. 475-500, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17 |
15 | Ha Thai Nguyen, Minh N. Do |
Hybrid Filter Banks With Fractional Delays: Minimax Design and Application to Multichannel Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(7-2), pp. 3180-3190, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Venkatesan Guruswami |
List Decoding and Pseudorandom Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings, pp. 1-6, 2007, Springer, 978-3-540-77223-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Abraham D. Flaxman, Alan M. Frieze, Juan Vera 0001 |
A Geometric Preferential Attachment Model of Networks II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAW ![In: Algorithms and Models for the Web-Graph, 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings, pp. 41-55, 2007, Springer, 978-3-540-77003-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
Expander Properties and the Cover Time of Random Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 44-55, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Ryan Culpepper, Matthias Felleisen |
Debugging macros. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GPCE ![In: Generative Programming and Component Engineering, 6th International Conference, GPCE 2007, Salzburg, Austria, October 1-3, 2007, Proceedings, pp. 135-144, 2007, ACM, 978-1-59593-855-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
15 | Ilan Newman, Yuri Rabinovich |
Hard Metrics from Cayley Graphs of Abelian Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 157-162, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke |
New lower bounds for oblivious routing in undirected graphs. ![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. 918-927, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Satish Rao, Shuheng Zhou |
Edge Disjoint Paths in Moderately Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 202-213, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman |
The Confluent Capacity of the Internet: Congestion vs. Dilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 4-7 July 2006, Lisboa, Portugal, pp. 5, 2006, IEEE Computer Society, 0-7695-2540-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
15 | Alexander A. Sapozhenko |
Systems of Containers and Enumeration Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings, pp. 1-13, 2005, Springer, 3-540-29498-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
15 | 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 |
|
15 | Robert Krauthgamer, Nathan Linial, Avner Magen |
Metric Embeddings--Beyond One-Dimensional Distortion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 31(3), pp. 339-356, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
15 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
Batch codes and their applications. ![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. 262-271, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
load balancing, coding, distributed storage, private information retrieval, locally decodable codes |
15 | 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 |
|
15 | Andrew A. Lamb, William Thies, Saman P. Amarasinghe |
Linear analysis and optimization of stream programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, San Diego, California, USA, June 9-11, 2003, pp. 12-25, 2003, ACM, 1-58113-662-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
algebraic simplification, optimization, embedded, FFT, DSP, linear systems, stream programming, StreamIt |
15 | Avi Wigderson |
Zigzag Products, Expander Constructions, Connections, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pp. 443, 2003, Springer, 3-540-20680-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma |
An optimal algorithm for checking regularity (extended abstract). ![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. 277-286, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
15 | Miroslav Chlebík, Janka Chlebíková |
Approximation Hardness of the Steiner Tree Problem on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 170-179, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Amit Chakrabarti, Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001 |
Approximation Algorithms for the Unsplittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 51-66, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan |
Approximation Algorithms for Partial Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 225-236, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering |
15 | Michal Koucký 0001 |
Universal Traversal Sequences with Backtracking. ![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. 21-27, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
|
15 | L. Sunil Chandran |
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings, pp. 283-290, 1999, Springer, 3-540-66836-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Tracy C. Denk, Keshab K. Parhi |
Synthesis of folded pipelined architectures for multirate DSP algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 6(4), pp. 595-607, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Petr Kolman |
On Nonblocking Properties on the Benes Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 259-270, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Stefan Hougardy |
Proof Checking and Non-approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 63-82, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
|
15 | Fong-Chih Shao, A. Yavuz Oruç |
Efficient Nonblocking Switching Networks for Interprocessor Communications in Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 6(2), pp. 132-141, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Phillip G. Bradford, Rudolf Fleischer |
Matching Nuts and Bolts Faster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 402-408, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
|
15 | C. Greg Plaxton, Torsten Suel |
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 618-629, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
15 | 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 |
|
15 | Shuji Jimbo, Akira Maruoka |
Selection Networks with 8n log2n Size and O(log n) Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 165-174, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Andrei Z. Broder, Alan M. Frieze, Eli Shamir 0001, Eli Upfal |
Near-perfect Token Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 308-317, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Edwin Hsing-Mean Sha, Kenneth Steiglitz |
Explicit construction for reliable reconfigurable array architectures. ![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. 640-647, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|