dblp.uni-trier.dewww.uni-trier.de

Luca Trevisan Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
143EEAnindya De, Luca Trevisan: Extractors Using Hardness Amplification. APPROX-RANDOM 2009: 462-475
142EEShachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630
141EELuca Trevisan: Max cut and the smallest eigenvalue. STOC 2009: 263-272
140EEJames Cook, Omid Etesami, Rachel Miller, Luca Trevisan: Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. TCC 2009: 521-538
139EEChandra Chekuri, Luca Trevisan: Foreword. Algorithmica 55(1): 111-112 (2009)
138EELuca Trevisan: Guest column: additive combinatorics and theoretical computer science. SIGACT News 40(2): 50-66 (2009)
2008
137EELuca Trevisan: Average-case Complexity. FOCS 2008: 11
136EEOmer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan: Dense Subsets of Pseudorandom Sets. FOCS 2008: 76-85
135EELuca Trevisan: Learning Heavy Fourier Coefficients of Boolean Functions. Encyclopedia of Algorithms 2008
134EELuca Trevisan: Max Cut and the Smallest Eigenvalue CoRR abs/0806.1978: (2008)
133EEOmer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan: Dense Subsets of Pseudorandom Sets. Electronic Colloquium on Computational Complexity (ECCC) 15(045): (2008)
132EELuca Trevisan, Madhur Tulsiani, Salil P. Vadhan: Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. Electronic Colloquium on Computational Complexity (ECCC) 15(103): (2008)
131EELuca Trevisan: Approximation Algorithms for Unique Games. Theory of Computing 4(1): 111-128 (2008)
2007
130EERan Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee: Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283
129EELuca Trevisan: Fun with Sub-linear Time Algorithms. FUN 2007: 15
128EEGrant Schoenebeck, Luca Trevisan, Madhur Tulsiani: A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. IEEE Conference on Computational Complexity 2007: 205-216
127EEGrant Schoenebeck, Luca Trevisan, Madhur Tulsiani: Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. STOC 2007: 302-310
126EELuca Trevisan, Salil P. Vadhan: Pseudorandomness and Average-Case Complexity Via Uniform Reductions. Computational Complexity 16(4): 331-364 (2007)
2006
125EEAlex Samorodnitsky, Luca Trevisan: Gowers uniformity, influence of variables, and PCPs. STOC 2006: 11-20
124EEOmer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC 2006: 457-466
123EELuca Trevisan: Pseudorandomness and Combinatorial Constructions CoRR abs/cs/0601100: (2006)
122EEAndrej Bogdanov, Luca Trevisan: Average-Case Complexity CoRR abs/cs/0606037: (2006)
121EEOded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan: Lower bounds for linear locally decodable codes and private information retrieval. Computational Complexity 15(3): 263-296 (2006)
120EELuca Trevisan: Pseudorandomness and Combinatorial Constructions Electronic Colloquium on Computational Complexity (ECCC)(013): (2006)
119EEAndrej Bogdanov, Luca Trevisan: Average-Case Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(073): (2006)
118EEGrant Schoenebeck, Luca Trevisan, Madhur Tulsiani: A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. Electronic Colloquium on Computational Complexity (ECCC) 13(098): (2006)
117EEGrant Schoenebeck, Luca Trevisan, Madhur Tulsiani: Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut. Electronic Colloquium on Computational Complexity (ECCC) 13(132): (2006)
116EEAndrej Bogdanov, Luca Trevisan: Average-Case Complexity. Foundations and Trends in Theoretical Computer Science 2(1): (2006)
115EEElchanan Mossel, Amir Shpilka, Luca Trevisan: On epsilon-biased generators in NC0. Random Struct. Algorithms 29(1): 56-81 (2006)
114EEAndrej Bogdanov, Luca Trevisan: On Worst-Case to Average-Case Reductions for NP Problems. SIAM J. Comput. 36(4): 1119-1159 (2006)
2005
113 Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings Springer 2005
112EEVenkatesan Guruswami, Luca Trevisan: The Complexity of Making Unique Choices: Approximating 1-in- k SAT. APPROX-RANDOM 2005: 99-110
111EELuca Trevisan: Approximation Algorithms for Unique Games. FOCS 2005: 197-205
110EELuca Trevisan: On uniform amplification of hardness in NP. STOC 2005: 31-38
109EELance Fortnow, Rahul Santhanam, Luca Trevisan: Hierarchies for semantic classes. STOC 2005: 348-355
108EEHenry C. Lin, Luca Trevisan, Hoeteck Wee: On Hardness Amplification of One-Way Functions. TCC 2005: 34-49
107EEAlex Samorodnitsky, Luca Trevisan: Gowers Uniformity, Influence of Variables, and PCPs CoRR abs/math/0510264: (2005)
106EELuca Trevisan, Salil P. Vadhan, David Zuckerman: Compression of Samplable Sources. Computational Complexity 14(3): 186-227 (2005)
105EELuca Trevisan, Salil P. Vadhan, David Zuckerman: Compression of Samplable Sources Electronic Colloquium on Computational Complexity (ECCC)(012): (2005)
104EEAndrej Bogdanov, Luca Trevisan: On Worst-Case to Average-Case Reductions for NP Problems Electronic Colloquium on Computational Complexity (ECCC)(015): (2005)
103EEOmer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem Electronic Colloquium on Computational Complexity (ECCC)(022): (2005)
102EELuca Trevisan: Approximation Algorithms for Unique Games Electronic Colloquium on Computational Complexity (ECCC)(034): (2005)
101EEAlex Samorodnitsky, Luca Trevisan: Gowers Uniformity, Influence of Variables, and PCPs Electronic Colloquium on Computational Complexity (ECCC)(116): (2005)
100EEChristian Schallhart, Luca Trevisan: Approximating Succinct MaxSat. J. Log. Comput. 15(4): 551-557 (2005)
99EEBernard Chazelle, Ronitt Rubinfeld, Luca Trevisan: Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM J. Comput. 34(6): 1370-1379 (2005)
98EERosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan: Bounds on the Efficiency of Generic Cryptographic Constructions. SIAM J. Comput. 35(1): 217-246 (2005)
97EEMaria J. Serna, Luca Trevisan, Fatos Xhafa: The approximability of non-Boolean satisfiability problems and restricted integer programming. Theor. Comput. Sci. 332(1-3): 123-139 (2005)
2004
96EELuca Trevisan: A Note on Approximate Counting for k-DNF. APPROX-RANDOM 2004: 417-426
95EELuca Trevisan, Salil P. Vadhan, David Zuckerman: Compression of Samplable Sources. IEEE Conference on Computational Complexity 2004: 1-14
94EEAndrej Bogdanov, Luca Trevisan: Lower Bounds for Testing Bipartiteness in Dense Graphs. IEEE Conference on Computational Complexity 2004: 75-81
93EEOmer Reingold, Luca Trevisan, Salil P. Vadhan: Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1-20
92EECynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan: List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC 2004: 101-120
91EELuca Trevisan: Inapproximability of Combinatorial Optimization Problems CoRR cs.CC/0409043: (2004)
90EELuca Trevisan: Some Applications of Coding Theory in Computational Complexity CoRR cs.CC/0409044: (2004)
89EELuca Trevisan: Some Applications of Coding Theory in Computational Complexity Electronic Colloquium on Computational Complexity (ECCC)(043): (2004)
88EELuca Trevisan: Inapproximability of Combinatorial Optimization Problems Electronic Colloquium on Computational Complexity (ECCC)(065): (2004)
87EEOded Goldreich, Madhu Sudan, Luca Trevisan: From logarithmic advice to single-bit advice Electronic Colloquium on Computational Complexity (ECCC)(093): (2004)
86EELance Fortnow, Rahul Santhanam, Luca Trevisan: Promise Hierarchies Electronic Colloquium on Computational Complexity (ECCC)(098): (2004)
85EELuca Trevisan: On Local Versus Global Satisfiability. SIAM J. Discrete Math. 17(4): 541-547 (2004)
2003
84EELuca Trevisan: Error-Correcting Codes in Complexity Theory. CIAC 2003: 4
83EELuca Trevisan: List-Decoding Using The XOR Lemma. FOCS 2003: 126-135
82EEElchanan Mossel, Amir Shpilka, Luca Trevisan: On e-Biased Generators in NC0. FOCS 2003: 136-145
81EEAndrej Bogdanov, Luca Trevisan: On Worst-Case to Average-Case Reductions for NP Problems. FOCS 2003: 308-317
80EELuca Trevisan: An epsilon-Biased Generator in NC0 Electronic Colloquium on Computational Complexity (ECCC) 10(013): (2003)
79EELuca Trevisan: List Decoding Using the XOR Lemma Electronic Colloquium on Computational Complexity (ECCC)(042): (2003)
78EEElchanan Mossel, Amir Shpilka, Luca Trevisan: On epsilon-Biased Generators in NC0 Electronic Colloquium on Computational Complexity (ECCC)(043): (2003)
77EEOded Goldreich, Luca Trevisan: Three theorems regarding testing graph properties. Random Struct. Algorithms 23(1): 23-57 (2003)
2002
76EEAndrej Bogdanov, Kenji Obata, Luca Trevisan: A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. FOCS 2002: 93-102
75EELuca Trevisan, Salil P. Vadhan: Pseudorandomness and Average-Case Complexity via Uniform Reductions. IEEE Conference on Computational Complexity 2002: 129-138
74EEZiv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel: Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002: 165-174
73EEOded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. IEEE Conference on Computational Complexity 2002: 175-183
72EEZiv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan: Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10
71EEAndrej Bogdanov, Luca Trevisan: Lower Bounds for Testing Bipartiteness in Dense Graphs Electronic Colloquium on Computational Complexity (ECCC)(064): (2002)
70EELuca Trevisan: A Note on Deterministic Approximate Counting for k-DNF Electronic Colloquium on Computational Complexity (ECCC)(069): (2002)
2001
69 Michel X. Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan: 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 Springer 2001
68 Oded Goldreich, Luca Trevisan: Three Theorems Regarding Testing Graph Properties. FOCS 2001: 460-469
67EEBernard Chazelle, Ronitt Rubinfeld, Luca Trevisan: Approximating the Minimum Spanning Tree Weight in Sublinear Time. ICALP 2001: 190-200
66EELuca Trevisan: Error-Correcting Codes and Pseudorandom Projections. RANDOM-APPROX 2001: 7-9
65EELuca Trevisan: Non-approximability results for optimization problems on bounded degree instances. STOC 2001: 453-461
64EEJosep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan: Approximating layout problems on random graphs. Discrete Mathematics 235(1-3): 245-253 (2001)
63EEOded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval Electronic Colloquium on Computational Complexity (ECCC)(080): (2001)
62EEOded Goldreich, Luca Trevisan: Three Theorems regarding Testing Graph Properties. Electronic Colloquium on Computational Complexity (ECCC) 8(10): (2001)
61 Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan: On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. 167(1): 10-26 (2001)
60EELuca Trevisan: Extractors and pseudorandom generators. J. ACM 48(4): 860-879 (2001)
59 Madhu Sudan, Luca Trevisan, Salil P. Vadhan: Pseudorandom Generators without the XOR Lemma. J. Comput. Syst. Sci. 62(2): 236-266 (2001)
2000
58 Rosario Gennaro, Luca Trevisan: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. FOCS 2000: 305-313
57 Luca Trevisan, Salil P. Vadhan: Extracting Randomness from Samplable Distributions. FOCS 2000: 32-42
56EELuca Trevisan: A Survey of Optimal PCP Characterizations of NP. IEEE Conference on Computational Complexity 2000: 146-
55EEAlex Samorodnitsky, Luca Trevisan: A PCP characterization of NP with optimal amortized query complexity. STOC 2000: 191-199
54EEJonathan Katz, Luca Trevisan: On the efficiency of local decoding procedures for error-correcting codes. STOC 2000: 80-86
53EELuca Trevisan: Erratum: A Correction to ``Parallel Approximation Algorithms by Positive Linear Programming''. Algorithmica 27(2): 115-119 (2000)
52EELuca Trevisan: Approximating Satisfiable Satisfiability Problems. Algorithmica 28(1): 145-172 (2000)
51 Luca Trevisan: Interactive and probabilistic proof-checking. Ann. Pure Appl. Logic 104(1-3): 325-342 (2000)
50EERosario Gennaro, Luca Trevisan: Lower Bounds on the Efficiency of Generic Cryptographic Constructions Electronic Colloquium on Computational Complexity (ECCC) 7(22): (2000)
49 Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson: Gadgets, Approximation, and Linear Programming. SIAM J. Comput. 29(6): 2074-2097 (2000)
48 Luca Trevisan: When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree. SIAM J. Comput. 30(2): 475-485 (2000)
47EESanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson: The Approximability of Constraint Satisfaction Problems. SIAM J. Comput. 30(6): 1863-1920 (2000)
46EEMichele Boreale, Luca Trevisan: A complexity analysis of bisimilarity for value-passing processes. Theor. Comput. Sci. 238(1-2): 313-345 (2000)
45EEPierluigi Crescenzi, Luca Trevisan: On Approximation Scheme Preserving Reducibility and Its Applications. Theory Comput. Syst. 33(1): 1-16 (2000)
1999
44EEMadhu Sudan, Luca Trevisan, Salil P. Vadhan: Pseudorandom Generators without the XOR Lemma (Abstract). IEEE Conference on Computational Complexity 1999: 4
43EELuca Trevisan: Construction of Extractors Using Pseudo-Random Generators (Extended Abstract). STOC 1999: 141-148
42EEMadhu Sudan, Luca Trevisan, Salil P. Vadhan: Pseudorandom Generators Without the XOR Lemma (Extended Abstract). STOC 1999: 537-546
41 Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan: Structure in Approximation Classes. SIAM J. Comput. 28(5): 1759-1782 (1999)
40 Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. SIAM J. Comput. 28(6): 2103-2116 (1999)
39EEAndrea E. F. Clementi, Luca Trevisan: Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. Theor. Comput. Sci. 225(1-2): 113-128 (1999)
38EEPierluigi Crescenzi, Luca Trevisan: Max NP-completeness Made Easy. Theor. Comput. Sci. 225(1-2): 65-79 (1999)
1998
37EEMadhu Sudan, Luca Trevisan: Probabilistically Checkable Proofs with Low Amortized Query Complexity. FOCS 1998: 18-27
36EEVenkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan: A Tight Characterization of NP with 3 Query PCPs. FOCS 1998: 8-17
35EEMaria J. Serna, Luca Trevisan, Fatos Xhafa: The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. STACS 1998: 488-498
34EELuca Trevisan: Recycling Queries in PCPs and in Linearity Tests (Extended Abstract). STOC 1998: 299-308
33 Luca Trevisan: Parallel Approximation Algorithms by Positive Linear Programming. Algorithmica 21(1): 72-88 (1998)
32 Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Recent Advances Towards Proving P = BPP. Bulletin of the EATCS 64: (1998)
31EEVenkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan: A tight characterization of NP with 3 query PCPs Electronic Colloquium on Computational Complexity (ECCC) 5(34): (1998)
30EEMadhu Sudan, Luca Trevisan: Probabilistically checkable proofs with low amortized query complexity Electronic Colloquium on Computational Complexity (ECCC) 5(40): (1998)
29EELuca Trevisan: Constructions of Near-Optimal Extractors Using Pseudo-Random Generators Electronic Colloquium on Computational Complexity (ECCC) 5(55): (1998)
28EELuca Trevisan: Recycling Queries in PCPs and in Linearity Tests Electronic Colloquium on Computational Complexity (ECCC) 5(7): (1998)
27EEMadhu Sudan, Luca Trevisan, Salil P. Vadhan: Pseudorandom generators without the XOR Lemma Electronic Colloquium on Computational Complexity (ECCC) 5(74): (1998)
26 José D. P. Rolim, Luca Trevisan: A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms. J. Comb. Optim. 2(3): 219-236 (1998)
25 Luca Trevisan, Fatos Xhafa: The Parallel Complexity of Positive Linear Programming. Parallel Processing Letters 8(4): 527-533 (1998)
1997
24EELuca Trevisan: Approximating Satisfiable Satisfiability Problems (Extended Abstract). ESA 1997: 472-485
23EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS 1997: 264-272
22EESanjeev Khanna, Madhu Sudan, Luca Trevisan: Constraint Satisfaction: The Approximability of Minimization Problems. IEEE Conference on Computational Complexity 1997: 282-296
21EELuca Trevisan: When Hamming Meets Euclid: The Approximability of Geometric TSP and MST (Extended Abstract). STOC 1997: 21-29
20EEMarco Cesati, Luca Trevisan: On the Efficiency of Polynomial Time Approximation Schemes Electronic Colloquium on Computational Complexity (ECCC) 4(1): (1997)
19EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations Electronic Colloquium on Computational Complexity (ECCC) 4(11): (1997)
18EELuca Trevisan: On Local versus Global Satisfiability Electronic Colloquium on Computational Complexity (ECCC) 4(12): (1997)
17EEPierluigi Crescenzi, Luca Trevisan: MAX NP-Completeness Made Easy Electronic Colloquium on Computational Complexity (ECCC) 4(39): (1997)
16EEMarco Cesati, Luca Trevisan: On the Efficiency of Polynomial Time Approximation Schemes. Inf. Process. Lett. 64(4): 165-171 (1997)
1996
15 Andrea E. F. Clementi, Luca Trevisan: Improved Non-approximability Results for Vertex Cover with Density Constraints. COCOON 1996: 333-342
14EELuca Trevisan: Positive Linear Programming, Parallel Approximation and PCP's. ESA 1996: 62-75
13 Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson: Gadgets, Approximation, and Linear Programming (extended abstract). FOCS 1996: 617-626
12 Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan: To Weight or Not to Weight: Where is the Question? ISTCS 1996: 68-77
11EEMichele Boreale, Luca Trevisan: Bisimilarity Problems Requiring Exponential Time. MFCS 1996: 230-241
10EEAndrea E. F. Clementi, Luca Trevisan: Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints Electronic Colloquium on Computational Complexity (ECCC) 3(16): (1996)
9EELuca Trevisan: On the Approximability of the Multi-dimensional Euclidean TSP Electronic Colloquium on Computational Complexity (ECCC) 3(46): (1996)
8EESanjeev Khanna, Madhu Sudan, Luca Trevisan: Constraint satisfaction: The approximability of minimization problems. Electronic Colloquium on Computational Complexity (ECCC) 3(64): (1996)
7EEPierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan: Structure in Approximation Classes Electronic Colloquium on Computational Complexity (ECCC) 3(66): (1996)
6 Pierluigi Crescenzi, Luca Trevisan: On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem. ITA 30(5): 431-441 (1996)
5EELuca Trevisan: A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees. Inf. Process. Lett. 57(5): 231-236 (1996)
1995
4 Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan: Structure in Approximation Classes (Extended Abstract). COCOON 1995: 539-548
3EEMichele Boreale, Luca Trevisan: On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract). FSTTCS 1995: 294-308
1994
2EEPierluigi Crescenzi, Luca Trevisan: On Approximation Scheme Preserving Reducability and Its Applications. FSTTCS 1994: 330-341
1EEPierluigi Crescenzi, Luca Trevisan: Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). WG 1994: 130-139

Coauthor Index

1Alexander E. Andreev [19] [23] [40]
2Ziv Bar-Yossef [72] [74]
3Andrej Bogdanov [71] [76] [81] [94] [104] [114] [116] [119] [122]
4Michele Boreale [3] [11] [46]
5Ran Canetti [130]
6Marco Cesati [16] [20]
7Bernard Chazelle [67] [99]
8Chandra Chekuri [113] [139]
9Andrea E. F. Clementi [10] [15] [19] [23] [32] [39] [40]
10James Cook [140]
11Pierluigi Crescenzi (Pilu Crescenzi) [1] [2] [4] [6] [7] [12] [17] [38] [41] [45] [61]
12Anindya De [143]
13Josep Díaz [64]
14Cynthia Dwork [92]
15Omid Etesami [140]
16Lance Fortnow [86] [109]
17Rosario Gennaro [50] [58] [98]
18Yael Gertner [98]
19Michel X. Goemans [69]
20Oded Goldreich [62] [63] [68] [73] [77] [87] [121]
21Venkatesan Guruswami [31] [36] [112]
22Klaus Jansen [69] [113]
23T. S. Jayram (Jayram S. Thathachar) [72]
24Viggo Kann [4] [7] [41]
25Howard J. Karloff [63] [73] [121]
26Jonathan Katz [54] [98]
27Sanjeev Khanna [8] [22] [47]
28Ravi Kumar (S. Ravi Kumar) [72]
29Daniel Lewin [31] [36]
30Henry C. Lin [108]
31Shachar Lovett [142]
32Rachel Miller [140]
33Elchanan Mossel [78] [82] [115]
34Kenji Obata [76]
35Jordi Petit [64]
36Omer Reingold [74] [93] [103] [124] [133] [136] [142]
37Ronald L. Rivest [130]
38José D. P. Rolim [19] [23] [26] [32] [40] [69] [113]
39Ronitt Rubinfeld [67] [99]
40Alex Samorodnitsky [55] [101] [107] [125]
41Rahul Santhanam [86] [109]
42Christian Schallhart [100]
43Grant Schoenebeck [117] [118] [127] [128]
44Leonard J. Schulman [63] [73] [121]
45Maria J. Serna [35] [64] [97]
46Ronen Shaltiel [74] [92]
47Amir Shpilka [78] [82] [115]
48Riccardo Silvestri [4] [7] [12] [41] [61]
49D. Sivakumar [72]
50Adam Smith [92]
51Gregory B. Sorkin [13] [49]
52Madhu Sudan [8] [13] [22] [27] [30] [31] [36] [37] [42] [44] [47] [49] [59] [87] [130]
53Madhur Tulsiani [117] [118] [127] [128] [132] [133] [136]
54Salil P. Vadhan [27] [42] [44] [57] [59] [75] [93] [95] [103] [105] [106] [124] [126] [130] [132] [133] [136] [142]
55Hoeteck Wee [108] [130]
56David P. Williamson [13] [47] [49]
57Fatos Xhafa [25] [35] [97]
58David Zuckerman [95] [105] [106]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)