Search results for "expanders"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Stasys Jukna	Expanders and time-restricted branching programs	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
19	Zeph Landau, Alexander Russell	Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem.	Electron. J. Comb.	2004	DBLP DOI BibTeX RDF
19	Roy Meshulam, Avi Wigderson	Expanders In Group Algebras.	Comb.	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.	Eur. J. Comb.	2004	DBLP DOI BibTeX RDF
19	Heeralal Janwa, Arbind K. Lal	On Expanders Graphs: Parameters and Applications	CoRR	2004	DBLP BibTeX RDF
19	Eyal Rozenman	Expanders, lifts and isoperimetric inequalities (גרפים מרחיבים, הרמות של גרפים ובעיות איזופרימטריות.).		2004	RDF
19	Roy Meshulam, Avi Wigderson	Expanders from Symmetric Codes.	CCC	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	Electron. Colloquium Comput. Complex.	2001	DBLP BibTeX RDF
19	Amnon Ta-Shma, Christopher Umans, David Zuckerman	Loss-less condensers, unbalanced expanders, and extractors.	STOC	2001	DBLP DOI BibTeX RDF
19	Marci J. Gambrell	Vertex-neighbor-integrity of magnifiers, expanders, and hypercubes.	Discret. Math.	2000	DBLP DOI BibTeX RDF
19	Uwe Schöning	Construction of expanders and superconcentrators using Kolmogorov complexity.	Random Struct. Algorithms	2000	DBLP DOI BibTeX RDF
19	Nathan Linial, Avner Magen	Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders.	J. Comb. Theory, Ser. B	2000	DBLP DOI BibTeX RDF
19	Avi Wigderson, David Zuckerman	Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications.	Comb.	1999	DBLP DOI BibTeX RDF
19	Igor Pak	Random Cayley Graphs with O(log[G]) Generators Are Expanders.	ESA	1999	DBLP DOI BibTeX RDF
19	William E. Ham	Recent Advances in Basic Physical Technology for Parallel SCSI: UltraSCSI, Expanders, Interconnect, and Hot Plugging.	Digit. Tech. J.	1998	DBLP BibTeX RDF
19	Uwe Schöning	Better Expanders and Superconcentrators by Kolmogorov Complexity.	SIROCCO	1997	DBLP BibTeX RDF
19	Matthew J. Katz	Improved Algorithms in Geometric Optimization via Expanders.	ISTCS	1995	DBLP DOI BibTeX RDF
19	Nikolai N. Kuzjurin	Multi-Processor Scheduling and Expanders.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
19	Miklós Ajtai	Recursive Construction for 3-Regular Expanders.	Comb.	1994	DBLP DOI BibTeX RDF
19	Noga Alon, Yuval Roichman	Random Cayley Graphs and Expanders.	Random Struct. Algorithms	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.	PCRCW	1994	DBLP DOI BibTeX RDF
19	Eric A. Brewer, Frederic T. Chong, Tom Leighton	Scalable expanders: exploiting hierarchical random wiring.	STOC	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		1994	RDF
19	Matthew J. Katz, Micha Sharir	Optimal Slope Selection via Expanders.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
19	Matthew J. Katz, Micha Sharir	Optimal Slope Selection Via Expanders.	CCCG	1993	DBLP BibTeX RDF
19	Avi Wigderson, David Zuckerman	Expanders that beat the eigenvalue bound: explicit construction and applications.	STOC	1993	DBLP DOI BibTeX RDF
19	Noga Alon, Yuval Roichman	Random Cayley Graphs and Expanders (Abstract).	Expanding Graphs	1992	DBLP DOI BibTeX RDF
19	Alexander Lubotzky, Benjamin Weiss 0002	Groups and Expanders.	Expanding Graphs	1992	DBLP DOI BibTeX RDF
19	Thomas H. Spencer	Parallel matching on expanders.	SPDP	1991	DBLP DOI BibTeX RDF
19	Andrew Thomason 0001	Dense expanders and pseudo-random bipartite graphs.	Discret. Math.	1989	DBLP DOI BibTeX RDF
19	Frank Thomson Leighton, Bruce M. Maggs	Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies	FOCS	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.	J. Comput. Syst. Sci.	1988	DBLP DOI BibTeX RDF
19	Shuji Jimbo, Akira Maruoka	Expanders obtained from affine transformations.	Comb.	1987	DBLP DOI BibTeX RDF
19	Noga Alon, Zvi Galil, V. D. Milman	Better Expanders and Superconcentrators.	J. Algorithms	1987	DBLP DOI BibTeX RDF
19	Miklós Ajtai	Recursive Construction for 3-Regular Expanders	FOCS	1987	DBLP DOI BibTeX RDF
19	Noga Alon	Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory.	Comb.	1986	DBLP DOI BibTeX RDF
19	Noga Alon	Eigenvalues and expanders.	Comb.	1986	DBLP DOI BibTeX RDF
19	Alexander Lubotzky, Ralph Phillips, Peter Sarnak	Explicit Expanders and the Ramanujan Conjectures	STOC	1986	DBLP DOI BibTeX RDF
19	Michael Sipser	Expanders, Randomness, or Time versus Space.	SCT	1986	DBLP DOI BibTeX RDF
19	Shuji Jimbo, Akira Maruoka	Expanders Obtained from Affine Transformations (Preliminary Version)	STOC	1985	DBLP DOI BibTeX RDF
19	Noga Alon	Expanders, Sorting in Rounds and Superconcentrators of Limited Depth	STOC	1985	DBLP DOI BibTeX RDF
19	Noga Alon, V. D. Milman	Eigenvalues, Expanders and Superconcentrators (Extended Abstract)	FOCS	1984	DBLP DOI BibTeX RDF
19	Eli Shamir 0001	From Expanders to Better Superconcentrators without Cascading.	STACS	1984	DBLP DOI BibTeX RDF
15	Thomas Sauerwald	Expansion and the cover time of parallel random walks.	PODC	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.	ICALP (1)	2009	DBLP DOI BibTeX RDF
15	Robert Elsässer, Thomas Sauerwald	Tight Bounds for the Cover Time of Multiple Random Walks.	ICALP (1)	2009	DBLP DOI BibTeX RDF
15	Tobias Friedrich 0001, Thomas Sauerwald	Near-perfect load balancing by randomized rounding.	STOC	2009	DBLP DOI BibTeX RDF	load balancing, randomized rounding
15	Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava	Twice-ramanujan sparsifiers.	STOC	2009	DBLP DOI BibTeX RDF	expander graphs, spectral graph theory
15	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification via Space-Efficient Direct Products.	Comput. Complex.	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.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
15	Venkatesan Guruswami	List Decoding and Pseudorandom Constructions.	AAECC	2007	DBLP DOI BibTeX RDF
15	Abraham D. Flaxman, Alan M. Frieze, Juan Vera 0001	A Geometric Preferential Attachment Model of Networks II.	WAW	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.	MFCS	2007	DBLP DOI BibTeX RDF
15	Ryan Culpepper, Matthias Felleisen	Debugging macros.	GPCE	2007	DBLP DOI BibTeX RDF
15	David P. Woodruff	Revisiting the Efficiency of Malicious Two-Party Computation.	EUROCRYPT	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.	STACS	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.	SODA	2006	DBLP DOI BibTeX RDF
15	Satish Rao, Shuheng Zhou	Edge Disjoint Paths in Moderately Connected Graphs.	ICALP (1)	2006	DBLP DOI BibTeX RDF
15	Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman	The Confluent Capacity of the Internet: Congestion vs. Dilation.	ICDCS	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.	SPAA	2006	DBLP DOI BibTeX RDF	parallel disk model, hashing, dictionary, expander graph, deterministic
15	Alexander A. Sapozhenko	Systems of Containers and Enumeration Problems.	SAGA	2005	DBLP DOI BibTeX RDF
15	Bogdan S. Chlebus, Dariusz R. Kowalski	Cooperative asynchronous update of shared memory.	STOC	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.	SIGACT News	2004	DBLP DOI BibTeX RDF
15	Robert Krauthgamer, Nathan Linial, Avner Magen	Metric Embeddings--Beyond One-Dimensional Distortion.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
15	Bogdan S. Chlebus, Dariusz R. Kowalski	A better wake-up in radio networks.	PODC	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.	STOC	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.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
15	Andrew A. Lamb, William Thies, Saman P. Amarasinghe	Linear analysis and optimization of stream programs.	PLDI	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.	FSTTCS	2003	DBLP DOI BibTeX RDF
15	Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma	An optimal algorithm for checking regularity (extended abstract).	SODA	2002	DBLP BibTeX RDF
15	Miroslav Chlebík, Janka Chlebíková	Approximation Hardness of the Steiner Tree Problem on Graphs.	SWAT	2002	DBLP DOI BibTeX RDF
15	Amit Chakrabarti, Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001	Approximation Algorithms for the Unsplittable Flow Problem.	APPROX	2002	DBLP DOI BibTeX RDF
15	Rajiv Gandhi, Samir Khuller, Aravind Srinivasan	Approximation Algorithms for Partial Covering Problems.	ICALP	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.	CCC	2001	DBLP DOI BibTeX RDF
15	Jin-yi Cai	Essentially Every Unimodular Matrix Defines and Expander.	ISAAC	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.	FSTTCS	1999	DBLP DOI BibTeX RDF
15	Tracy C. Denk, Keshab K. Parhi	Synthesis of folded pipelined architectures for multirate DSP algorithms.	IEEE Trans. Very Large Scale Integr. Syst.	1998	DBLP DOI BibTeX RDF
15	Petr Kolman	On Nonblocking Properties on the Benes Network.	ESA	1998	DBLP DOI BibTeX RDF
15	Stefan Hougardy	Proof Checking and Non-approximability.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
15	Uwe Schöning	Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity.	MFCS	1997	DBLP DOI BibTeX RDF
15	Fong-Chih Shao, A. Yavuz Oruç	Efficient Nonblocking Switching Networks for Interprocessor Communications in Multiprocessor Systems.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
15	Phillip G. Bradford, Rudolf Fleischer	Matching Nuts and Bolts Faster.	ISAAC	1995	DBLP DOI BibTeX RDF
15	Sotiris E. Nikoletseas, Paul G. Spirakis	Expander Properties in Random Regular Graphs with Edge Faults.	STACS	1995	DBLP DOI BibTeX RDF
15	C. Greg Plaxton, Torsten Suel	A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.	ICALP	1994	DBLP DOI BibTeX RDF
15	Shimon Even, Ami Litman	A Unified Scheme for Routing in Expander Based Networks.	CIAC	1994	DBLP DOI BibTeX RDF
15	Shuji Jimbo, Akira Maruoka	Selection Networks with 8n log2n Size and O(log n) Depth.	ISAAC	1992	DBLP DOI BibTeX RDF
15	Andrei Z. Broder, Alan M. Frieze, Eli Shamir 0001, Eli Upfal	Near-perfect Token Distribution.	ICALP	1992	DBLP DOI BibTeX RDF
15	Edwin Hsing-Mean Sha, Kenneth Steiglitz	Explicit construction for reliable reconfigurable array architectures.	SPDP	1991	DBLP DOI BibTeX RDF