Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
18 | Rajesh K. Pankaj |
All-Optical Network Topologies Based on Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. High Speed Networks ![In: J. High Speed Networks 4(2), pp. 117-131, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
Existence and Construction of Edge-Disjoint Paths on Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 23(5), pp. 976-989, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Shlomo Hoory, Avi Wigderson |
Universal Traversal Sequences for Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 46(2), pp. 67-69, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Pierre Kelsen |
Fast Parallel Matching in Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '93, Velen, Germany, June 30 - July 2, 1993, pp. 293-299, 1993, ACM, 0-89791-599-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Nabil Kahalé |
Expander graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1993 |
RDF |
|
18 | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
Existence and Construction of Edge Disjoint Paths on Expander Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pp. 140-149, 1992, ACM, 0-89791-511-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
18 | Ronitt Rubinfeld |
The Cover Time of a Regular Expander is O(n log n). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 35(1), pp. 49-51, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
18 | David Peleg, Eli Upfal |
Constructng disjoint paths on expander graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 9(3), pp. 289-313, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
18 | David Peleg, Eli Upfal |
Constructing Disjoint Paths on Expander Graphs (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 264-273, 1987, ACM, 0-89791-221-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
13 | Sherif Sakr, Ahmed Awad 0001 |
A framework for querying graph-based business process models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 19th International Conference on World Wide Web, WWW 2010, Raleigh, North Carolina, USA, April 26-30, 2010, pp. 1297-1300, 2010, ACM, 978-1-60558-799-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
querying business process - bpmn, process models |
13 | Arun S. Maiya, Tanya Y. Berger-Wolf |
Sampling community structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 19th International Conference on World Wide Web, WWW 2010, Raleigh, North Carolina, USA, April 26-30, 2010, pp. 701-710, 2010, ACM, 978-1-60558-799-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
clustering, social networks, graphs, sampling, complex networks, community detection |
13 | Stefano Pini, Sangmok Han, David R. Wallace |
Text entry for mobile devices using ad-hoc abbreviation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AVI ![In: Proceedings of the International Conference on Advanced Visual Interfaces, AVI 2010, Roma, Italy, May 26-28, 2010, pp. 181-188, 2010, ACM Press, 978-1-4503-0076-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
support vector machine, mobile devices, Hidden Markov model, text input, auto-completion, abbreviation |
13 | Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng |
Subgraph sparsification and nearly optimal ultrasparsifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 57-66, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
algebraic connectivity, graph sparsification, ultrasparsifiers, approximation algorithms |
13 | James Aspnes, Udi Wieder |
The expansion and mixing time of skip graphs with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 21(6), pp. 385-393, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(4), pp. 19:1-19:15, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Edge-separator, single commodity max-flow, sparse cut, spectral method |
13 | Jure Leskovec |
Networks, communities and kronecker products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM-CNIKM ![In: Proceeding of the ACM First International Workshop on Complex Networks Meet Information & Knowledge Management, CIKM-CNIKM 2009, Hong Kong, China, November 6, 2009, pp. 1-2, 2009, ACM, 978-1-60558-807-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
kronecker graphs, network community profile, social networks, graph partitioning, community structure, conductance |
13 | James Aspnes, Keren Censor |
Approximate shared-memory counting despite a strong adversary. ![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. 441-450, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
Dynamic vs. Oblivious Routing in Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 277-288, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Benjamin Doerr, Tobias Friedrich 0001, Thomas Sauerwald |
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ![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. 366-377, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani |
The detectability lemma and quantum gap amplification. ![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. 417-426, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
QMA, detectability lemma, gap amplification, local hamiltonians, quantum computation, PCP |
13 | Sanjeev Arora, Constantinos Daskalakis, David Steurer |
Message passing algorithms and improved LP decoding. ![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. 3-12, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
lp decoding, min-sum algorithm, ldpc codes, message-passing algorithms |
13 | Klim Efremenko, Omer Reingold |
How Well Do Random Walks Parallelize?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 476-489, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Markov Chains, Random Walks |
13 | Aram W. Harrow, Richard Andrew Low |
Efficient Quantum Tensor Product Expanders and k-Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 548-561, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Eli Ben-Sasson, Michael Viderman |
Composition of Semi-LTCs by Two-Wise Tensor Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 378-391, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | 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 |
13 | Venkatesan Guruswami, Atri Rudra |
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(1), pp. 135-150, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
13 | Richard C. Wang, William W. Cohen |
Iterative Set Expansion of Named Entities Using the Web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 1091-1096, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
13 | László Babai, Nikolay Nikolov, László Pyber |
Product growth and mixing in finite groups. ![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. 248-257, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
13 | Jure Leskovec, Kevin J. Lang, Anirban Dasgupta 0001, Michael W. Mahoney |
Statistical properties of community structure in large social and information networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pp. 695-704, 2008, ACM, 978-1-60558-085-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
social networks, random walks, graph partitioning, community structure, conductance |
13 | Angsheng Li, Linqing Tang |
Derandomizing Graph Tests for Homomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 105-115, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
13 | Daniel A. Spielman, Nikhil Srivastava |
Graph sparsification by effective resistances. ![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. 563-568, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
electrical flows, random sampling, spectral graph theory |
13 | Eli Ben-Sasson, Michael Viderman |
Tensor Products of Weakly Smooth Codes Are Robust. ![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. 290-302, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
13 | Zeev Dvir, Amir Shpilka |
Towards Dimension Expanders over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 304-310, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cayley graphs, expanders, explicit constructions |
13 | Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma |
Quantum Expanders: Motivation and Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 292-303, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Quantum Expanders, Quantum Statistical Zero-Knowledge |
13 | Elchanan Mossel, Sébastien Roch |
Slow emergence of cooperation for win-stay lose-shift on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 67(1-2), pp. 7-22, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Games on graphs, Prisoner’s dilemma game, Win-Stay Lose-Shift, Oriented percolation, Emergence of cooperation, Learning |
13 | Irit Dinur |
The PCP theorem by gap amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(3), pp. 12, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gap amplification, PCP |
13 | Salil P. Vadhan |
The unified theory of pseudorandomness: guest column. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 38(3), pp. 39-54, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Rainer Bye, Katja Luther, Seyit Ahmet Çamtepe, Tansu Alpcan, Sahin Albayrak, Bülent Yener |
Decentralized Detector Generation in Cooperative Intrusion Detection Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 9th International Symposium, SSS 2007, Paris, France, November 14-16, 2007, Proceedings, pp. 37-51, 2007, Springer, 978-3-540-76626-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Artur Czumaj, Christian Sohler |
On testable properties in bounded degree graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 494-501, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
13 | Noga Alon, Michael R. Capalbo |
Finding Disjoint Paths in Expanders Deterministically and Online. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 518-524, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Artur Czumaj, Christian Sohler |
Testing Expansion in Bounded-Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 570-578, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Shankar Kalyanaraman, Christopher Umans |
Algorithms for Playing Games with Limited Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 323-334, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | 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 |
|
13 | 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 |
|
13 | Ueli M. Maurer, Stefano Tessaro |
Domain Extension of Public Random Functions: Beyond the Birthday Barrier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings, pp. 187-204, 2007, Springer, 978-3-540-74142-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Gamburd, Igor Pak |
Expansion Of Product Replacement Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(4), pp. 411-429, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C90, 20F99, 68R10 |
13 | Todd P. Coleman, Anna H. Lee, Muriel Médard, Michelle Effros |
Low-Complexity Approaches to Slepian-Wolf Near-Lossless Distributed Data Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3546-3561, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Subhas Kumar Ghosh |
On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESAS ![In: Security and Privacy in Ad-Hoc and Sensor Networks, Third European Workshop, ESAS 2006, Hamburg, Germany, September 20-21, 2006, Revised Selected Papers, pp. 121-135, 2006, Springer, 978-3-540-69172-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Amnon Ta-Shma, Christopher Umans |
Better lossless condensers through derandomized curve samplers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 177-186, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Arist Kojevnikov, Dmitry Itsykson |
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ![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. 323-334, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Jaikumar Radhakrishnan |
Gap Amplification in PCPs Using Lazy Random Walks. ![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. 96-107, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Abraham D. Flaxman |
Expansion and Lack Thereof in Randomly Perturbed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAW ![In: Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers, pp. 24-35, 2006, Springer, 978-3-540-78807-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Lance Fortnow, Adam R. Klivans |
Linear Advice for Randomized Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 469-476, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Venkatesan Guruswami, Atri Rudra |
Explicit capacity-achieving list-decodable codes. ![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. 1-10, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Zyablov bound, algebraic decoding, Reed-Solomon codes, list decoding, channel capacity |
13 | Irit Dinur |
The PCP theorem by gap amplification. ![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. 241-250, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
gap amplification, PCP |
13 | Rohit Khandekar, Satish Rao, Umesh V. Vazirani |
Graph partitioning using single commodity flows. ![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. 385-390, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
edge-separator, single commodity max-flow, sparse cut, spectral method |
13 | Irit Dinur, Madhu Sudan 0001, Avi Wigderson |
Robust Local Testability of Tensor Products of LDPC Codes. ![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. 304-315, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Vicky Choi, Navin Goyal |
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 298-310, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification Via Space-Efficient Direct Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 556-568, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
error-correcting codes, expanders, Direct products, hardness amplification |
13 | Shi-Chun Tsai, Wen-Guey Tzeng, Hsin-Lung Wu |
On the Jensen-Shannon Divergence and Variational Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(9), pp. 3333-3336, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Barg, Gilles Zémor |
Concatenated codes: serial and parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(5), pp. 1625-1634, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Yevgeniy Dodis, Adam D. Smith |
Entropic Security and the Encryption of High Entropy Messages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pp. 556-577, 2005, Springer, 3-540-24573-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Nedialko B. Dimitrov, C. Greg Plaxton |
Optimal Cover Time for a Graph-Based Coupon Collector Process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 702-716, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | David Jao, Stephen D. Miller, Ramarathnam Venkatesan |
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings, pp. 21-40, 2005, Springer, 3-540-30684-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
random reducibility, modular forms, L-functions, generalized Riemann hypothesis, elliptic curves, expanders, Ramanujan graphs, isogenies, rapid mixing, discrete log |
13 | Eran Rom, Amnon Ta-Shma |
Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 557-568, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | James Aspnes, Udi Wieder |
The expansion and mixing time of skip graphs with applications. ![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. 126-134, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
P2P, expansion |
13 | 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 |
13 | Douglas E. Carroll, Ashish Goel |
Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 146-156, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Venkatesan Guruswami, Piotr Indyk |
Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 695-707, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Luigi Dadda, Marco Macchetti, Jeff Owen |
An ASIC design for a high speed implementation of the hash function SHA-256 (384, 512). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, Boston, MA, USA, April 26-28, 2004, pp. 421-425, 2004, ACM, 1-58113-853-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
secure hash standard, hash function, data authentication |
13 | Eyal Rozenman, Aner Shalev, Avi Wigderson |
A new family of Cayley expanders (?). ![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. 445-454, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
zig-zag product, Cayley graphs, expanders |
13 | Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman |
Collective asynchronous reading with polylogarithmic worst-case overhead. ![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. 321-330, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
graph expansion, distributed algorithms, collect |
13 | Dan Gutfreund, Emanuele Viola |
Fooling Parity Tests with Parity Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 381-392, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Alessandro Panconesi, Jaikumar Radhakrishnan |
Expansion properties of (secure) wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 281-285, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
security, ad hoc networks, wireless networks, distributed algorithms, connectivity, expanders |
13 | Heeralal Janwa, Arbind K. Lal |
On Tanner Codes: Minimum Distance and Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 13(5), pp. 335-347, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Yair Bartal, Manor Mendel |
Multi-embedding and path approximation of metric spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 424-433, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
13 | Aris Anagnostopoulos, Adam Kirsch, Eli Upfal |
Stability and Efficiency of a Random Local Load Balancing Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 472-481, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Christos Gkantsidis, Milena Mihail, Amin Saberi |
Conductance and congestion in power law graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2003, June 9-14, 2003, San Diego, CA, USA, pp. 148-159, 2003, ACM, 1-58113-664-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
powerlaw graphs, routing, congestion, expansion, internet topology, conductance |
13 | George Danezis |
Mix-Networks with Restricted Routes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Privacy Enhancing Technologies ![In: Privacy Enhancing Technologies, Third International Workshop, PET 2003, Dresden, Germany, March 26-28, 2003, Revised Papers, pp. 1-17, 2003, Springer, 3-540-20610-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
mix cascades, anonymity, traffic analysis, Mix networks |
13 | Andrea Maniero, Andrea Gerosa, Andrea Neviani |
Performance optimization in micro-power, low-voltage log-domain filters in pure CMOS technology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (1) ![In: Proceedings of the 2003 International Symposium on Circuits and Systems, ISCAS 2003, Bangkok, Thailand, May 25-28, 2003, pp. 565-568, 2003, IEEE, 0-7803-7761-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Sergey G. Bobkov, Prasad Tetali |
Modified log-sobolev inequalities, mixing and hypercontractivity. ![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. 287-296, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
entropy decay, sobolev inequalities, spectral gap |
13 | Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson |
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. ![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. 612-621, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing |
13 | Oded Goldreich 0001, Dana Ron |
Property Testing in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(2), pp. 302-343, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Randomized algorithms, Graph algorithms, Property testing |
13 | Salil P. Vadhan |
Randomness Extractors and their Many Guises. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 9-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Jan Johannsen, N. S. Narayanaswamy |
An Optimal Lower Bound for Resolution with 2-Conjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 387-398, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec |
Circular Separability of Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 30(1), pp. 67-82, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Randomized algorithms, Graph algorithms, Property testing |
13 | Salil P. Vadhan |
Order in Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 10-11, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
13 | 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 |
|
13 | Elena Dubrova, Peeter Ellervee, D. Michael Miller, Jon C. Muzio |
TOP: An Algorithm for Three-Level Optimization of PLDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2000 Design, Automation and Test in Europe (DATE 2000), 27-30 March 2000, Paris, France, pp. 751, 2000, IEEE Computer Society / ACM, 0-7695-0537-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
13 | Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern |
Scalable Secure Storage when Half the System Is Faulty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 576-587, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
13 | Oded Goldreich 0001, Dana Ron |
A Sublinear Bipartiteness Tester for Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(3), pp. 335-373, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R10 |
13 | Jacobo Torán |
Lower Bounds for Space in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, pp. 362-373, 1999, Springer, 3-540-66536-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Resolution, space, complexity measures, pebbling game |
13 | Andreas Goerdt |
Random Regular Graphs with Edge Faults: Expansion through Cores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 219-228, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
13 | Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan |
Speeding up Discrete Log and Factoring Based Schemes via Precomputations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 221-235, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
13 | Dimitris Fotakis 0001, Paul G. Spirakis |
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, pp. 360-371, 1996, Springer, 3-540-61550-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
13 | 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 |
|
13 | 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 |
|
13 | Stephen Dean Brown, Jonathan Rose, Zvonko G. Vranesic |
A detailed router for field-programmable gate arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(5), pp. 620-628, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
13 | Elias Dahlhaus, Marek Karpinski |
A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 139-144, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
13 | Alasdair Urquhart |
Hard examples for resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 34(1), pp. 209-219, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|