 | 2009 |
|---|
| 98 |       | Irit 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 |
| 97 | | Marios Karagiannis,
Ioannis Chatzigiannakis,
José D. P. Rolim:
WSNGE: a platform for simulating complex wireless sensor networks supporting rich network visualization and online interactivity.
SpringSim 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 |
| 95 | | Luminita 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 |
| 94 | | Michael 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 |
| 93 | | Andrei 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 |
| 92 | | Pierre Leone,
Sotiris E. Nikoletseas,
José D. P. Rolim:
Randomized Energy Balance Algorithms in Sensor Networks.
Encyclopedia of Algorithms 2008 |
| 91 | | Andrei Marculescu,
Sotiris E. Nikoletseas,
Olivier Powell,
José D. P. Rolim:
Lighweight Target Tracking Using Passive Traces in Sensor Networks
CoRR abs/0803.2219: (2008) |
| 90 | | Sotiris E. Nikoletseas,
José D. P. Rolim:
Preface.
Theor. Comput. Sci. 402(1): 1 (2008) |
| 89 | | Carme À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 |
| 87 | | Ioannis 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 |
| 86 | | Luminita 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 |
| 85 | | Olivier 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 |
| 82 | | Pierre 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 |
| 81 | | Aubin 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 |
| 80 | | Matthieu 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 |
| 79 | | Pierre 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) |
| 78 | | Charilaos 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 |
| 76 | | Pierre 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 |
| 75 | | Pierre 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 |
| 74 | | Pierre Leone,
Olivier Powell,
José D. P. Rolim:
Energy Optimal Data Propagation in Wireless Sensor Networks
CoRR abs/cs/0508052: (2005) |
| 73 | | Olivier Powell,
Aubin Jarry,
Pierre Leone,
José D. P. Rolim:
Gradient Based Routing in Wireless Sensor Networks: a Mixed Strategy
CoRR abs/cs/0511083: (2005) |
| 72 | | Sotiris E. Nikoletseas,
José D. P. Rolim:
Preface.
Theor. Comput. Sci. 344(1): 1-2 (2005) |
| 71 | | Pierre 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 |
| 69 | | Pierre Leone,
José D. P. Rolim:
Towards a Dynamical Model for Wireless Sensor Networks.
ALGOSENSORS 2004: 98-108 |
| 68 | | Charilaos Efthymiou,
Sotiris E. Nikoletseas,
José D. P. Rolim:
Energy Balanced Data Propagation in Wireless Sensor Networks.
IPDPS 2004 |
| 67 | | Carme À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 |
| 66 | | Claude 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 |
| 63 | | Mitali 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 |
| 62 | | Claude 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 |
| 59 | | Klaus 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 |
| 56 | | Andreas Dandalis,
Viktor K. Prasanna,
José D. P. Rolim:
A Comparative Study of Performance of AES Final Candidates Using FPGAs.
CHES 2000: 125-140 |
| 55 | | Andreas Dandalis,
Viktor K. Prasanna,
José D. P. Rolim:
An Adaptive Cryptographic Engine for IPSec Architectures.
FCCM 2000: 132-144 |
| 54 | | Danuta Sosnowska,
José D. P. Rolim:
Fleet Scheduling Optimization: A Simulated Annealing Approach.
PATAT 2000: 227-242 |
| 53 | | Alexander 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 |
| 50 | | Alexander 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 |
| 49 | | Alexander 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) |
| 47 | | Alexander 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 |
| 43 | | Klaus 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) |
| 41 | | José D. P. Rolim,
Pavel Tvrdík,
Jan Trdlicka,
Imrich Vrto:
Bisecting De Bruijn and Kautz Graphs.
Discrete Applied Mathematics 85(1): 87-97 (1998) |
| 40 | | Alexander 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) |
| 36 | | Alexander 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 |
| 33 | | Alexander E. Andreev,
Andrea E. F. Clementi,
José D. P. Rolim,
Luca Trevisan:
Weak Random Sources, Hitting Sets, and BPP Simulations.
FOCS 1997: 264-272 |
| 32 | | Alexander 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 |
| 31 | | Pavol 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 |
| 30 | | Alexander E. Andreev,
Andrea E. F. Clementi,
José D. P. Rolim:
Efficient Construction of Hitting Sets for Systems of Linear Functions.
STACS 1997: 387-398 |
| 29 | | Alexander 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) |
| 28 | | Pavol 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) |
| 27 | | Alexander 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) |
| 26 | | Alexander 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 |
| 24 | | Alexander E. Andreev,
Andrea E. F. Clementi,
José D. P. Rolim:
Hitting Sets Derandomize BPP.
ICALP 1996: 357-368 |
| 23 | | Bogdan 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 |
| 21 | | Alexander 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 |
| 19 | | Alexander 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) |
| 18 | | Alexander 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) |
| 17 | | Alexander 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 |
| 14 | | Alexander 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 |
| 12 | | Pavol Duris,
José D. P. Rolim:
Optimal Lower Bounds on the Multiparty Communication Complexity.
STACS 1995: 350-360 |
| 11 | | José D. P. Rolim,
Ondrej Sýkora,
Imrich Vrto:
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes.
WG 1995: 252-264 |
| 10 | | Alexander 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) |
| 9 | | Alexander E. Andreev,
Andrea E. F. Clementi,
José D. P. Rolim:
Hitting Sets Derandomize BPP
Electronic Colloquium on Computational Complexity (ECCC) 2(61): (1995) |
| 1994 |
|---|
| 8 | | Pavol 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 |
|---|
| 4 | | José 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) |
