The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

José D. P. Rolim: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Leone, José D. P. Rolim
    Towards a Dynamical Model for Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:98-108 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:119-129 [Conf]
  3. Andreas Dandalis, Viktor K. Prasanna, José D. P. Rolim
    A Comparative Study of Performance of AES Final Candidates Using FPGAs. [Citation Graph (0, 0)][DBLP]
    CHES, 2000, pp:125-140 [Conf]
  4. Aubin Jarry, Pierre Leone, Olivier Powell, José D. P. Rolim
    An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2006, pp:405-421 [Conf]
  5. Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim
    An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2005, pp:35-48 [Conf]
  6. Andreas Dandalis, Viktor K. Prasanna, José D. P. Rolim
    An Adaptive Cryptographic Engine for IPSec Architectures. [Citation Graph (0, 0)][DBLP]
    FCCM, 2000, pp:132-144 [Conf]
  7. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Weak Random Sources, Hitting Sets, and BPP Simulations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:264-272 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:179-189 [Conf]
  9. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Hitting Sets Derandomize BPP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:357-368 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:177-187 [Conf]
  11. José D. P. Rolim
    On the Formal Aspects of Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    ICCI, 1990, pp:24-33 [Conf]
  12. Mitali Singh, Viktor K. Prasanna, José D. P. Rolim, Cauligi S. Raghavendra
    Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays. [Citation Graph (0, 0)][DBLP]
    PWC, 2003, pp:1-11 [Conf]
  13. Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki
    Distributing Tokens on a Hypercube without Error Accumulation. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:573-578 [Conf]
  14. Charilaos Efthymiou, Sotiris E. Nikoletseas, José D. P. Rolim
    Energy Balanced Data Propagation in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:132-141 [Conf]
  16. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    On the Parallel Computation of Boolean Functions on Unrelated inputs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:155-161 [Conf]
  17. José D. P. Rolim
    On the Density and Core of the Complexity Classes. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:448-459 [Conf]
  18. Pavol Duris, José D. P. Rolim
    E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:38-51 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    Mobility Management & Wireless Access Protocols, 2004, pp:106-110 [Conf]
  20. Danuta Sosnowska, José D. P. Rolim
    Fleet Scheduling Optimization: A Simulated Annealing Approach. [Citation Graph (0, 0)][DBLP]
    PATAT, 2000, pp:227-242 [Conf]
  21. Andrea E. F. Clementi, José D. P. Rolim, Erik Urland
    Randomized parallel algorithms. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:25-50 [Conf]
  22. José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
    Bisecting de Bruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:211-222 [Conf]
  23. Klaus Jansen, José D. P. Rolim
    Algorithms Based on Randomization and Linear and Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:124-134 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:68-77 [Conf]
  25. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:319-330 [Conf]
  26. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Efficient Construction of Hitting Sets for Systems of Linear Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:387-398 [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:117-128 [Conf]
  28. Pavol Duris, José D. P. Rolim
    Optimal Lower Bounds on the Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:350-360 [Conf]
  29. Claude Tadonki, Mitali Singh, José D. P. Rolim, Viktor K. Prasanna
    Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:265-268 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:341-353 [Conf]
  31. Matthieu Bouget, Pierre Leone, José D. P. Rolim
    Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:13-23 [Conf]
  32. Claude Tadonki, José D. P. Rolim
    An Analytical Model for Energy Minimization. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:559-569 [Conf]
  33. José D. P. Rolim, Ondrej Sýkora, Imrich Vrto
    Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:252-264 [Conf]
  34. Klaus Jansen, José D. P. Rolim
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:351-352 [Journal]
  35. José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
    Bisecting De Bruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:1, pp:87-97 [Journal]
  36. Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Recent Advances Towards Proving P = BPP. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:64, n:, pp:- [Journal]
  37. Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
    Parallel Read Operations Without Memory Contention [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:53, pp:- [Journal]
  38. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Optimal Bounds for the Approximation of Boolean Functions and Some Applications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:41, pp:- [Journal]
  39. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Hitting Sets Derandomize BPP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:61, pp:- [Journal]
  40. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Towards efficient constructions of hitting sets that derandomize BPP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:29, pp:- [Journal]
  41. Alexander E. AndreevAndrea E. F. Clementi, José D. P. Rolim
    Hitting Properties of Hard Boolean Operators and their Consequences on BPP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:55, pp:- [Journal]
  42. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Weak Random Sources, Hitting Sets, and BPP Simulations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:11, pp:- [Journal]
  43. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:29, pp:- [Journal]
  44. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:53, pp:- [Journal]
  45. Pavol Duris, José D. P. Rolim
    Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1994, v:5, n:3/4, pp:319-328 [Journal]
  46. José D. P. Rolim
    On the Polynomial IO-Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:4, pp:199-204 [Journal]
  47. José D. P. Rolim, Sheila A. Greibach
    On the IO-Complexity and Approximation Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:1, pp:27-31 [Journal]
  48. José D. P. Rolim, Sheila A. Greibach
    A Note on the Best-Case Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:3, pp:133-138 [Journal]
  49. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    A New General Derandomization Method. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:1, pp:179-213 [Journal]
  50. José D. P. Rolim, Luca Trevisan
    A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:3, pp:219-236 [Journal]
  51. Pavol Duris, José D. P. Rolim
    Lower Bounds on the Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:1, pp:90-95 [Journal]
  52. 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. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  53. Afonso Ferreira, José D. P. Rolim
    Special Issue on Irregular Problems in Supercomputing Applications: Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:50, n:1/2, pp:1-2 [Journal]
  54. Olivier Powell, Pierre Leone, José D. P. Rolim
    Energy optimal data propagation in wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:3, pp:302-317 [Journal]
  55. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Weak Random Sources, Hitting Sets, and BPP Simulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2103-2116 [Journal]
  56. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:261-282 [Journal]
  57. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:307-314 [Journal]
  58. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Optimal Bounds for the Approximation of Boolean Functions and Some Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:243-268 [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:3-18 [Journal]
  60. Pavol Duris, José D. P. Rolim
    A Note on the Density of Oracle Decreasing Time-Space Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:435-444 [Journal]
  61. Afonso Ferreira, José D. P. Rolim
    Foreword to the Special Issue on Parallelism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:171-172 [Journal]
  62. Pierre Leone, José D. P. Rolim
    Towards a dynamical model for wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:344, n:1, pp:69-85 [Journal]
  63. Sotiris E. Nikoletseas, José D. P. Rolim
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:344, n:1, pp:1-2 [Journal]
  64. Charilaos Efthymiou, Sotiris E. Nikoletseas, José D. P. Rolim
    Energy balanced data propagation in wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:6, pp:691-707 [Journal]

  65. Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  66. Coverage-Adaptive Random Walks for Fast Sensory Data Collection. [Citation Graph (, )][DBLP]


  67. Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  68. The Design of an Open and Integrated Sensor Network Management Platform. [Citation Graph (, )][DBLP]


  69. Optimal Data Gathering Paths and Energy Balance Mechanisms in Wireless Networks. [Citation Graph (, )][DBLP]


  70. Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms. [Citation Graph (, )][DBLP]


  71. Near-optimal data propagation by efficiently advertising obstacle boundaries. [Citation Graph (, )][DBLP]


  72. Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio. [Citation Graph (, )][DBLP]


  73. Data Propagation with Guaranteed Delivery for Mobile Networks. [Citation Graph (, )][DBLP]


  74. Efficient Tracking of Moving Targets by Passively Handling Traces in Sensor Networks. [Citation Graph (, )][DBLP]


  75. Biased Sink Mobility with Adaptive Stop Times for Low Latency Data Collection in Sensor Networks. [Citation Graph (, )][DBLP]


  76. Fast and energy efficient sensor data collection by multiple mobile sinks. [Citation Graph (, )][DBLP]


  77. WSNGE: a platform for simulating complex wireless sensor networks supporting rich network visualization and online interactivity. [Citation Graph (, )][DBLP]


  78. Energy Optimal Data Propagation in Wireless Sensor Networks [Citation Graph (, )][DBLP]


  79. Gradient Based Routing in Wireless Sensor Networks: a Mixed Strategy [Citation Graph (, )][DBLP]


  80. Lighweight Target Tracking Using Passive Traces in Sensor Networks [Citation Graph (, )][DBLP]


  81. VRAC: Theory #1 [Citation Graph (, )][DBLP]


Search in 0.566secs, Finished in 0.572secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002