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

José D. P. Rolim 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
97EEIrit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim: 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 Springer 2009
2008
96 Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld: 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 Springer 2008
95EELuminita Moraru, Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim: Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks. ADHOC-NOW 2008: 148-161
94EEMichael N. Kalochristianakis, Vasileios Gkamas, Georgios Mylonas, Sotiris E. Nikoletseas, José D. P. Rolim, Emmanouel A. Varvarigos: The Design of an Open and Integrated Sensor Network Management Platform. APNOMS 2008: 495-498
93EEAndrei Marculescu, Sotiris E. Nikoletseas, Olivier Powell, José D. P. Rolim: Efficient Tracking of Moving Targets by Passively Handling Traces in Sensor Networks. GLOBECOM 2008: 271-276
92EEPierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim: Randomized Energy Balance Algorithms in Sensor Networks. Encyclopedia of Algorithms 2008
91EEAndrei Marculescu, Sotiris E. Nikoletseas, Olivier Powell, José D. P. Rolim: Lighweight Target Tracking Using Passive Traces in Sensor Networks CoRR abs/0803.2219: (2008)
90EESotiris E. Nikoletseas, José D. P. Rolim: Preface. Theor. Comput. Sci. 402(1): 1 (2008)
89EECarme Àlvarez, Josep Díaz, Jordi Petit, José D. P. Rolim, Maria J. Serna: High level communication functionalities for wireless sensor networks. Theor. Comput. Sci. 406(3): 240-247 (2008)
2007
88 Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings Springer 2007
87EEIoannis Chatzigiannakis, Athanasios Kinalis, Sotiris E. Nikoletseas, José D. P. Rolim: Fast and energy efficient sensor data collection by multiple mobile sinks. MOBIWAC 2007: 25-32
86EELuminita Moraru, Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim: Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms. Q2SWinet 2007: 31-38
85EEOlivier Powell, Pierre Leone, José D. P. Rolim: Energy optimal data propagation in wireless sensor networks. J. Parallel Distrib. Comput. 67(3): 302-317 (2007)
2006
84 Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick: 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 Springer 2006
83 Sotiris E. Nikoletseas, José D. P. Rolim: Algorithmic Aspects of Wireless Sensor Networks, Second International Workshop, ALGOSENSORS 2006, Venice, Italy, July 15, 2006, Revised Selected Papers Springer 2006
82EEPierre Leone, Luminita Moraru, Olivier Powell, José D. P. Rolim: Localization Algorithm for Wireless Ad-Hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition. ALGOSENSORS 2006: 119-129
81EEAubin Jarry, Pierre Leone, Olivier Powell, José D. P. Rolim: An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks. DCOSS 2006: 405-421
80EEMatthieu Bouget, Pierre Leone, José D. P. Rolim: Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks. WEA 2006: 13-23
79EEPierre Leone, José D. P. Rolim, Paul Albuquerque, Christian Mazza: A framework for probabilistic numerical evaluation of sensor networks: A case study of a localization protocol. ACM Journal of Experimental Algorithmics 11: (2006)
78EECharilaos Efthymiou, Sotiris E. Nikoletseas, José D. P. Rolim: Energy balanced data propagation in wireless sensor networks. Wireless Networks 12(6): 691-707 (2006)
2005
77 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
76EEPierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim: An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks. DCOSS 2005: 35-48
75EEPierre Leone, Paul Albuquerque, Christian Mazza, José D. P. Rolim: A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol. WEA 2005: 341-353
74EEPierre Leone, Olivier Powell, José D. P. Rolim: Energy Optimal Data Propagation in Wireless Sensor Networks CoRR abs/cs/0508052: (2005)
73EEOlivier Powell, Aubin Jarry, Pierre Leone, José D. P. Rolim: Gradient Based Routing in Wireless Sensor Networks: a Mixed Strategy CoRR abs/cs/0511083: (2005)
72EESotiris E. Nikoletseas, José D. P. Rolim: Preface. Theor. Comput. Sci. 344(1): 1-2 (2005)
71EEPierre Leone, José D. P. Rolim: Towards a dynamical model for wireless sensor networks. Theor. Comput. Sci. 344(1): 69-85 (2005)
2004
70 Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron: 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 Springer 2004
69EEPierre Leone, José D. P. Rolim: Towards a Dynamical Model for Wireless Sensor Networks. ALGOSENSORS 2004: 98-108
68EECharilaos Efthymiou, Sotiris E. Nikoletseas, José D. P. Rolim: Energy Balanced Data Propagation in Wireless Sensor Networks. IPDPS 2004
67EECarme Àlvarez, Josep Díaz, Jordi Petit, José D. P. Rolim, Maria J. Serna: Efficient and reliable high level communication in randomly deployed wireless sensor networks. Mobility Management & Wireless Access Protocols 2004: 106-110
66EEClaude Tadonki, José D. P. Rolim: An Analytical Model for Energy Minimization. WEA 2004: 559-569
2003
65 Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim: Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings Springer 2003
64 Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NY, USA, August 24-26, 2003, Proceedings Springer 2003
63EEMitali Singh, Viktor K. Prasanna, José D. P. Rolim, Cauligi S. Raghavendra: Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays. PWC 2003: 1-11
62EEClaude Tadonki, Mitali Singh, José D. P. Rolim, Viktor K. Prasanna: Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems. WAOA 2003: 265-268
2002
61 José D. P. Rolim, Salil P. Vadhan: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings Springer 2002
2001
60 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
59EEKlaus Jansen, José D. P. Rolim: Guest Editors' Introduction. Algorithmica 30(3): 351-352 (2001)
2000
58 José D. P. Rolim: Parallel and Distributed Processing, 15 IPDPS 2000 Workshops, Cancun, Mexico, May 1-5, 2000, Proceedings Springer 2000
57 Ugo Montanari, José D. P. Rolim, Emo Welzl: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings Springer 2000
56EEAndreas Dandalis, Viktor K. Prasanna, José D. P. Rolim: A Comparative Study of Performance of AES Final Candidates Using FPGAs. CHES 2000: 125-140
55EEAndreas Dandalis, Viktor K. Prasanna, José D. P. Rolim: An Adaptive Cryptographic Engine for IPSec Architectures. FCCM 2000: 132-144
54EEDanuta Sosnowska, José D. P. Rolim: Fleet Scheduling Optimization: A Simulated Annealing Approach. PATAT 2000: 227-242
53EEAlexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Parallel Read Operations Without Memory Contention Electronic Colloquium on Computational Complexity (ECCC) 7(53): (2000)
1999
52 José D. P. Rolim, Frank Mueller, Albert Y. Zomaya, Fikret Erçal, Stephan Olariu, Binoy Ravindran, Jan Gustafsson, Hiroaki Takada, Ronald A. Olsson, Laxmikant V. Kalé, Peter H. Beckman, Matthew Haines, Hossam A. ElGindy, Denis Caromel, Serge Chaumette, Geoffrey Fox, Yi Pan, Keqin Li, Tao Yang, G. Ghiola, Gianni Conte, Luigi V. Mancini, Dominique Méry, Beverly A. Sanders, Devesh Bhatt, Viktor K. Prasanna: Parallel and Distributed Processing, 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, San Juan, Puerto Rico, USA, April 12-16, 1999, Proceedings Springer 1999
51 Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim, Alistair Sinclair: Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings Springer 1999
50EEAlexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim: Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ICALP 1999: 179-189
49EEAlexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS 1999: 68-77
48 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)
47EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. Theor. Comput. Sci. 221(1-2): 3-18 (1999)
1998
46 José D. P. Rolim: Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30 - April 3, 1998, Proceedings Springer 1998
45 Afonso Ferreira, José D. P. Rolim, Horst D. Simon, Shang-Hua Teng: Solving Irregularly Structured Problems in Parallel, 5th International Symposium, IRREGULAR '98, Berkeley, California, USA, August 9-11, 1998, Proceedings Springer 1998
44 Michael Luby, José D. P. Rolim, Maria J. Serna: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings Springer 1998
43EEKlaus Jansen, José D. P. Rolim: Algorithms Based on Randomization and Linear and Semidefinite Programming. SOFSEM 1998: 124-134
42 Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Recent Advances Towards Proving P = BPP. Bulletin of the EATCS 64: (1998)
41EEJosé D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto: Bisecting De Bruijn and Kautz Graphs. Discrete Applied Mathematics 85(1): 87-97 (1998)
40EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: A New General Derandomization Method. J. ACM 45(1): 179-213 (1998)
39 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)
38 Pavol Duris, José D. P. Rolim: Lower Bounds on the Multiparty Communication Complexity. J. Comput. Syst. Sci. 56(1): 90-95 (1998)
37 Afonso Ferreira, José D. P. Rolim: Special Issue on Irregular Problems in Supercomputing Applications: Guest Editors' Introduction. J. Parallel Distrib. Comput. 50(1/2): 1-2 (1998)
36EEAlexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998)
1997
35 Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, José D. P. Rolim: Solving Irregularly Structured Problems in Parallel, 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings Springer 1997
34 José D. P. Rolim: Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings Springer 1997
33EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS 1997: 264-272
32EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. ICALP 1997: 177-187
31EEPavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger: Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. STACS 1997: 117-128
30EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Efficient Construction of Hitting Sets for Systems of Linear Functions. STACS 1997: 387-398
29EEAlexander 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)
28EEPavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger: On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations Electronic Colloquium on Computational Complexity (ECCC) 4(29): (1997)
27EEAlexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim: Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 4(53): (1997)
26EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Theor. Comput. Sci. 180(1-2): 243-268 (1997)
1996
25 Afonso Ferreira, José D. P. Rolim, Yousef Saad, Tao Yang: Parallel Algorithms for Irregularly Structured Problems, Third International Workshop, IRREGULAR '96, Santa Barbara, California, USA, August 19-21, 1996, Proceedings Springer 1996
24EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP. ICALP 1996: 357-368
23EEBogdan S. Chlebus, José D. P. Rolim, Giora Slutzki: Distributing Tokens on a Hypercube without Error Accumulation. IPPS 1996: 573-578
22 Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: On the Parallel Computation of Boolean Functions on Unrelated inputs. ISTCS 1996: 155-161
21EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. STACS 1996: 319-330
20 Andrea E. F. Clementi, José D. P. Rolim, Erik Urland: Randomized parallel algorithms. Solving Combinatorial Optimization Problems in Parallel 1996: 25-50
19EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Towards efficient constructions of hitting sets that derandomize BPP Electronic Colloquium on Computational Complexity (ECCC) 3(29): (1996)
18EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Properties of Hard Boolean Operators and their Consequences on BPP Electronic Colloquium on Computational Complexity (ECCC) 3(55): (1996)
17EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. Theor. Comput. Sci. 161(1&2): 307-314 (1996)
16 Afonso Ferreira, José D. P. Rolim: Foreword to the Special Issue on Parallelism. Theor. Comput. Sci. 162(2): 171-172 (1996)
1995
15 Afonso Ferreira, José D. P. Rolim: Parallel Algorithms for Irregularly Structured Problems, Second International Workshop, IRREGULAR '95, Lyon, France, September 4-6, 1995, Proceedings Springer 1995
14EEAlexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141
13 José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto: Bisecting de Bruijn and Kautz Graphs. SIROCCO 1995: 211-222
12EEPavol Duris, José D. P. Rolim: Optimal Lower Bounds on the Multiparty Communication Complexity. STACS 1995: 350-360
11EEJosé D. P. Rolim, Ondrej Sýkora, Imrich Vrto: Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. WG 1995: 252-264
10EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds for the Approximation of Boolean Functions and Some Applications Electronic Colloquium on Computational Complexity (ECCC) 2(41): (1995)
9EEAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP Electronic Colloquium on Computational Complexity (ECCC) 2(61): (1995)
1994
8EEPavol Duris, José D. P. Rolim: E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. MFCS 1994: 38-51
7 Pavol Duris, José D. P. Rolim: Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. Int. J. Found. Comput. Sci. 5(3/4): 319-328 (1994)
6 Pavol Duris, José D. P. Rolim: A Note on the Density of Oracle Decreasing Time-Space Complexity. Theor. Comput. Sci. 132(2): 435-444 (1994)
1992
5 José D. P. Rolim: On the Density and Core of the Complexity Classes. LATIN 1992: 448-459
1990
4EEJosé D. P. Rolim: On the Formal Aspects of Approximation Algorithms. ICCI 1990: 24-33
1989
3 José D. P. Rolim, Sheila A. Greibach: A Note on the Best-Case Complexity. Inf. Process. Lett. 30(3): 133-138 (1989)
2 José D. P. Rolim: On the Polynomial IO-Complexity. Inf. Process. Lett. 33(4): 199-204 (1989)
1988
1 José D. P. Rolim, Sheila A. Greibach: On the IO-Complexity and Approximation Languages. Inf. Process. Lett. 28(1): 27-31 (1988)

Coauthor Index

1Sergio De Agostino [14] [36]
2Paul Albuquerque [75] [79]
3Carme Àlvarez [67] [89]
4Alexander E. Andreev [9] [10] [14] [17] [18] [19] [21] [22] [24] [26] [27] [29] [30] [32] [33] [36] [40] [47] [48] [49] [50] [53]
5Sanjeev Arora [64]
6Juri L. Baskakov [27] [50]
7Peter H. Beckman [52]
8Devesh Bhatt [52]
9Gianfranco Bilardi [35]
10Matthieu Bouget [80]
11Denis Caromel [52]
12Moses Charikar [88]
13Ioannis Chatzigiannakis [87]
14Serge Chaumette [52]
15Chandra Chekuri [77]
16Bogdan S. Chlebus [23]
17Andrea E. F. Clementi [9] [10] [14] [17] [18] [19] [20] [21] [22] [24] [26] [27] [29] [30] [32] [33] [36] [40] [42] [47] [48] [49] [50] [53]
18Gianni Conte [52]
19Pierluigi Crescenzi (Pilu Crescenzi) [14] [36]
20Elias Dahlhaus [14] [36]
21Andreas Dandalis [55] [56]
22Josep Díaz [67] [84] [89]
23Irit Dinur [97]
24Pavol Duris [6] [7] [8] [12] [28] [31] [38]
25Charilaos Efthymiou [68] [78]
26Hossam A. ElGindy [52]
27Fikret Erçal [52]
28Afonso Ferreira [15] [16] [25] [35] [37] [45]
29Geoffrey Fox (Geoffrey Charles Fox) [52]
30G. Ghiola [52]
31Vasileios Gkamas [94]
32Ashish Goel [96]
33Michel X. Goemans [60]
34Sheila A. Greibach [1] [3]
35Jan Gustafsson [52]
36Matthew Haines [52]
37Dorit S. Hochbaum [51]
38Juraj Hromkovic [28] [31]
39Klaus Jansen [43] [51] [59] [60] [64] [65] [70] [77] [84] [88] [96] [97]
40Aubin Jarry [73] [81]
41Laxmikant V. Kalé [52]
42Michael N. Kalochristianakis [94]
43Sanjeev Khanna [70]
44Athanasios Kinalis [87]
45Pierre Leone [69] [71] [73] [74] [75] [76] [79] [80] [81] [82] [85] [86] [92] [95]
46Keqin Li [52]
47Michael Luby [44]
48Reinhard Lüling [35]
49Luigi V. Mancini [52]
50Andrei Marculescu [91] [93]
51Marian Margraf [65]
52Monaldo Mastrolilli [65]
53Christian Mazza [75] [79]
54Dominique Méry [52]
55Ugo Montanari [57]
56Luminita Moraru [82] [86] [95]
57Frank Mueller [52]
58Georgios Mylonas [94]
59Joseph Naor (Seffi Naor) [97]
60Sotiris E. Nikoletseas [68] [72] [76] [78] [83] [86] [87] [90] [91] [92] [93] [94] [95]
61Stephan Olariu [52]
62Ronald A. Olsson [52]
63Yi Pan [52]
64Paolo Penna [49] [53]
65Jordi Petit [67] [89]
66Olivier Powell [73] [74] [81] [82] [85] [91] [93]
67Viktor K. Prasanna (V. K. Prasanna Kumar) [52] [55] [56] [62] [63]
68Cauligi S. Raghavendra (C. S. Raghavendra) [63]
69Binoy Ravindran [52]
70Omer Reingold [88]
71Dana Ron [70]
72Ronitt Rubinfeld [96]
73Yousef Saad [25]
74Amit Sahai [64]
75Beverly A. Sanders [52]
76Georg Schnitger [28] [31]
77Maria J. Serna [44] [67] [89]
78Horst D. Simon [45]
79Alistair Sinclair [51]
80Mitali Singh [62] [63]
81Giora Slutzki [23]
82Danuta Sosnowska [54]
83Ondrej Sýkora [11]
84Claude Tadonki [62] [66]
85Hiroaki Takada [52]
86Shang-Hua Teng [45]
87Jan Trdlicka [13] [41]
88Luca Trevisan [29] [33] [39] [42] [48] [60] [77]
89Pavel Tvrdík [13] [41]
90Erik Urland [20]
91Salil P. Vadhan [61]
92Emmanouel A. Varvarigos [94]
93Imrich Vrto [11] [13] [41]
94Emo Welzl [57]
95Tao Yang [25] [52]
96Albert Y. Zomaya [52]
97Uri Zwick [84]

Colors in the list of coauthors

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