default search action
José D. P. Rolim
Person information
- affiliation: University of Geneva, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j36]Minas Gadalla
, Sotiris E. Nikoletseas, José Roberto de A. Amazonas, José D. P. Rolim:
Concepts and experiments on psychoanalysis driven computing. Intell. Syst. Appl. 18: 200201 (2023) - 2022
- [c83]Julia Buwaya, José D. P. Rolim:
NoiseBay: A Real-World Study on Transparent Data Collection. IC3 2022: 493-501 - [i18]Minas Gadalla, Sotiris E. Nikoletseas, José Roberto de A. Amazonas, José D. P. Rolim:
Concepts and Experiments on Psychoanalysis Driven Computing. CoRR abs/2210.00850 (2022) - 2020
- [j35]Pierre Leone, Kasun Samarasinghe, José D. P. Rolim:
Every Schnyder drawing is a greedy embedding. Theor. Comput. Sci. 807: 234-244 (2020) - [c82]Stéphane Kuendig
Crowdsourced Edge: A Novel Networking Paradigm for the Collaborative Community. DCOSS 2020: 474-481
2010 – 2019
- 2019
- [p4]Constantinos Marios Angelopoulos
User Incentivization in Mobile Crowdsensing Systems. Mission-Oriented Sensor Networks and Systems (2) 2019: 259-286 - [p3]Sotiris E. Nikoletseas, Theofanis P. Raptis
Radiation Control Algorithms in Wireless Networks. Mission-Oriented Sensor Networks and Systems (2) 2019: 719-756 - 2018
- [j34]Luca Luceri, Felipe Cardoso, Michela Papandrea
VIVO: A secure, privacy-preserving, and real-time crowd-sensing framework for the Internet of Things. Pervasive Mob. Comput. 49: 126-138 (2018) - [c81]Stéphane Kuendig
Modelled Testbeds: Visualizing and Augmenting Physical Testbeds with Virtual Resources. ICITS 2018: 804-812 - [e35]Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA. LIPIcs 116, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-085-9 [contents] - 2017
- [c80]Julia Buwaya, José D. P. Rolim:
Atomic Routing Mechanisms for Balance of Costs and Quality in Mobile Crowdsensing Systems. DCOSS 2017: 147-154 - [c79]Julia Buwaya, José D. P. Rolim:
Load Balancing Mechanisms to Regulate Costs and Quality in Mobile Crowdsensing Systems. DCOSS 2017: 215-222 - [c78]Julia Buwaya, José D. P. Rolim:
Mobile Crowdsensing from a Selfish Routing Perspective. IPDPS Workshops 2017: 1457-1463 - [c77]Zhongliang Zhao, Stéphane Kuendig
Indoor Location for Smart Environments with Wireless Sensor and Actuator Networks. LCN 2017: 535-538 - [e34]Klaus Jansen, José D. P. Rolim, David Williamson, Santosh S. Vempala:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. LIPIcs 81, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-044-6 [contents] - 2016
- [c76]Panagiotis Alexandrou, Constantinos Marios Angelopoulos
A Service Based Architecture for Multidisciplinary IoT Experiments with Crowdsourced Resources. ADHOC-NOW 2016: 187-201 - [c75]Sébastien Ziegler, José D. P. Rolim, Sotiris E. Nikoletseas:
Internet of Things, Crowdsourcing and Systemic Risk Management for Smart Cities and Nations: Initial insight from IoT Lab European Research project. AINA Workshops 2016: 611-616 - [c74]Julia Buwaya, José D. P. Rolim:
Bounding Distributed Energy Balancing Schemes for WSNs via Modular Subgames. DCOSS 2016: 153-160 - [c73]Stéphane Kuendig, Pierre Leone, José D. P. Rolim:
A Distributed Algorithm Using Path Dissemination for Publish-Subscribe Communication Patterns. MobiWac 2016: 35-42 - [p2]Constantinos Marios Angelopoulos
Strategies for Wireless Recharging in Mobile Ad-Hoc Networks. Wireless Power Transfer Algorithms, Technologies and Applications in Ad Hoc Communication Networks 2016: 305-330 - [e33]Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France. LIPIcs 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-018-7 [contents] - [r2]Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Randomized Energy Balance Algorithms in Sensor Networks. Encyclopedia of Algorithms 2016: 1741-1745 - 2015
- [j33]Constantinos Marios Angelopoulos
Design and evaluation of characteristic incentive mechanisms in Mobile Crowdsensing Systems. Simul. Model. Pract. Theory 55: 95-106 (2015) - [c72]Constantinos Marios Angelopoulos
Towards a holistic federation of secure crowd-enabled IoT facilities. ICC 2015: 555-560 - [c71]Constantinos Marios Angelopoulos
A user-enabled testbed architecture with mobile crowdsensing support for smart, green buildings. ICC 2015: 573-578 - [c70]Andreea Hossmann-Picu
Synergistic User ⟷ Context Analytics. ICT Innovations 2015: 163-172 - [c69]Constantinos Marios Angelopoulos
Traversal Strategies for Wireless Power Transfer in Mobile Ad-Hoc Networks. MSWiM 2015: 31-40 - [c68]Orestis Evangelatos, José D. P. Rolim:
AIRWISE - An Airborne Wireless Sensor Network for Ambient Air Pollution Monitoring. SENSORNETS 2015: 231-239 - [c67]Sébastien Ziegler, Sotiris E. Nikoletseas, Srdjan Krco, José D. P. Rolim, João Fernandes:
Internet of Things and crowd sourcing - a paradigm change for the research on the Internet of Things. WF-IoT 2015: 395-399 - [e32]Naveen Garg, Klaus Jansen, Anup Rao, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA. LIPIcs 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-89-7 [contents] - 2014
- [j32]Athanasios Kinalis, Sotiris E. Nikoletseas, Dimitra Patroumpa, José D. P. Rolim:
Biased sink mobility with adaptive stop times for low latency data collection in sensor networks. Inf. Fusion 15: 56-63 (2014) - [j31]Konstantinos Chantzis, Ioannis Chatzigiannakis
Design and evaluation of a real-time locating system for wireless sensor networks. J. Locat. Based Serv. 8(2): 97-122 (2014) - [c66]Konstantinos Chantzis, Dimitrios Amaxilatis
Symmetric Coherent Link Degree, Adaptive Throughput-Transmission Power for Wireless Sensor Networks. DCOSS 2014: 26-34 - [c65]Konstantinos Chantzis, Dimitrios Amaxilatis, Ioannis Chatzigiannakis, José D. P. Rolim:
SCLD-ATP: Symmetric Coherent Link Degree, Adaptive Transmission Power Control for Wireless Sensor Networks. SENSORNETS 2014: 5-16 - [c64]Constantinos Marios Angelopoulos
Characteristic utilities, join policies and efficient incentives in Mobile Crowdsensing Systems. Wireless Days 2014: 1-6 - [e31]Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. LIPIcs 28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-74-3 [contents] - 2013
- [c63]Orestis Evangelatos, Kasun Samarasinghe, José D. P. Rolim:
Syndesi: A Framework for Creating Personalized Smart Environments Using Wireless Sensor Networks. DCOSS 2013: 325-330 - [c62]Marcelo G. Almiron, Olga Goussevskaia, Antonio A. F. Loureiro, José D. P. Rolim:
Connectivity in obstructed wireless networks: from geometry to percolation. MobiHoc 2013: 157-166 - [c61]Ara Alexanyan, Hakob Aslanyan, José D. P. Rolim:
Symmetric-key encryption scheme based on the strong generating sets of permutation groups. PerCom Workshops 2013: 470-474 - [c60]Hakob Aslanyan, Tigran Tonoyan, José D. P. Rolim:
Low radiation paths in wireless networks pass along Voronoi diagram. SoftCOM 2013: 1-5 - [e30]Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings. Lecture Notes in Computer Science 8096, Springer 2013, ISBN 978-3-642-40327-9 [contents] - [i17]Hakob Aslanyan, José D. P. Rolim:
Quantitative Characterization of Randomly Roving Agents. CoRR abs/1303.0525 (2013) - 2012
- [j30]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
On the efficiency of routing in sensor networks. J. Parallel Distributed Comput. 72(7): 889-901 (2012) - [j29]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Virtual raw anchor coordinates: A new localization paradigm. Theor. Comput. Sci. 453: 44-53 (2012) - [c59]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm. DCOSS 2012: 140-149 - [c58]Sotiris E. Nikoletseas, Dimitra Patroumpa, Viktor K. Prasanna, Christoforos L. Raptopoulos, José D. P. Rolim:
Radiation Awareness in Three-Dimensional Wireless Sensor Networks. DCOSS 2012: 176-185 - [c57]Marios Karagiannis
Irida: A Real-Time Wireless Sensor Network Visualization Feedback Protocol. DCOSS 2012: 372-377 - [c56]Orestis Evangelatos, Kasun Samarasinghe, José D. P. Rolim:
Evaluating design approaches for smart building systems. MASS Workshops 2012: 1-7 - [c55]Constantinos Marios Angelopoulos
Fine-grained in-door localisation with wireless sensor networks. MOBIWAC 2012: 159-162 - [e29]Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Lecture Notes in Computer Science 7408, Springer 2012, ISBN 978-3-642-32511-3 [contents] - [e28]José D. P. Rolim, Jun Luo, Sotiris E. Nikoletseas:
Proceedings of the 10th ACM International Symposium on Mobility Management and Wireless Access, MOBIWAC '12, Paphos, Cyprus, October 21-22, 2012. ACM 2012, ISBN 978-1-4503-1623-1 [contents] - [i16]Marios Karagiannis, Ioannis Chatzigiannakis, José D. P. Rolim:
Multilateration: Methods For Clustering Intersection Points For Wireless Sensor Networks Localization With Distance Estimation Error. CoRR abs/1203.3704 (2012) - [i15]Marios Karagiannis, Laetitia Dallinge, José D. P. Rolim:
Irida: A real-time Wireless Sensor Network visualization feedback protocol. CoRR abs/1203.4154 (2012) - 2011
- [j28]Aubin Jarry, Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Optimal data gathering paths and energy-balance mechanisms in wireless networks. Ad Hoc Networks 9(6): 1036-1048 (2011) - [c54]Marios Karagiannis
Passive target tracking: Application with mobile devices using an indoors WSN Future Internet testbed. DCOSS 2011: 1-6 - [c53]Sotiris E. Nikoletseas, Dimitra Patroumpa, Christoforos L. Raptopoulos, José D. P. Rolim:
Work-in-progress: Efficient heuristics for low radiation paths in wireless sensor networks. DCOSS 2011: 1-3 - [c52]José D. P. Rolim:
Energy Balance Mechanisms and Lifetime Optimization of Wireless Networks. IC3 2011: 1 - [c51]Konstantinos Chantzis, Christos Koninis, Ioannis Chatzigiannakis
Design and Evaluation of a Lightweight Tracking Algorithm using WSN. MASS 2011: 640-645 - [p1]Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Energy-Balanced Data Propagation inWireless Sensor Networks. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 481-513 - [e27]Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6845, Springer 2011, ISBN 978-3-642-22934-3 [contents] - [e26]José D. P. Rolim, Jun Luo, Sotiris E. Nikoletseas:
Proceedings of the 9th ACM International Workshop on Mobility Management & Wireless Access, MOBIWAC 2011, October 31- November 4, 2011, Miami Beach, FL, USA. ACM 2011, ISBN 978-1-4503-0901-1 [contents] - [e25]Sotiris E. Nikoletseas, José D. P. Rolim:
Theoretical Aspects of Distributed Computing in Sensor Networks. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2011, ISBN 978-3-642-14848-4 [contents] - [i14]Hakob Aslanyan, José D. P. Rolim:
Randomly Roving Agents in Wireless Sensor Networks. CoRR abs/1105.3346 (2011) - [i13]Aubin Jarry, Florian Huc, Pierre Leone, José D. P. Rolim:
Distributed Planarization and Local Routing Strategies in Sensor Networks. CoRR abs/1107.5154 (2011) - 2010
- [j27]Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks. Theory Comput. Syst. 47(2): 433-453 (2010) - [j26]Luminita Moraru
Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles. Wirel. Commun. Mob. Comput. 10(5): 647-661 (2010) - [c50]Constantinos Marios Angelopoulos
Coverage-Adaptive Random Walks for Fast Sensory Data Collection. ADHOC-NOW 2010: 81-94 - [c49]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Virtual Raw Anchor Coordinates: A New Localization Paradigm. ALGOSENSORS 2010: 161-175 - [c48]Aubin Jarry, Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Optimal Data Gathering Paths and Energy Balance Mechanisms in Wireless Networks. DCOSS 2010: 288-305 - [c47]Hakob Aslanyan, José D. P. Rolim:
Interference Minimization in Wireless Networks. EUC 2010: 444-449 - [c46]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio. PODC 2010: 116-117 - [c45]Hakob Aslanyan, Pierre Leone, José D. P. Rolim:
Data Propagation with Guaranteed Delivery for Mobile Networks. SEA 2010: 386-397 - [e24]Maria J. Serna
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings. Lecture Notes in Computer Science 6302, Springer 2010, ISBN 978-3-642-15368-6 [contents] - [i12]Aubin Jarry, Pierre Leone, José D. P. Rolim:
VRAC: Theory #1. CoRR abs/1002.0484 (2010)
2000 – 2009
- 2009
- [c44]Florian Huc, Aubin Jarry, Pierre Leone, Luminita Moraru
Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks. ALGOSENSORS 2009: 102-115 - [c43]Athanasios Kinalis, Sotiris E. Nikoletseas, Dimitra Patroumpa, José D. P. Rolim:
Biased Sink Mobility with Adaptive Stop Times for Low Latency Data Collection in Sensor Networks. GLOBECOM 2009: 1-6 - [c42]Michael N. Kalochristianakis, Vasileios Gkamas, Georgios Mylonas
An open and integrated management platform for wireless sensor networks. ISADS 2009: 217-222 - [c41]Andreas Koutsopoulos, Sotiris E. Nikoletseas, José D. P. Rolim:
Near-optimal data propagation by efficiently advertising obstacle boundaries. PE-WASUN 2009: 15-22 - [c40]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 - [e23]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. Lecture Notes in Computer Science 5687, Springer 2009, ISBN 978-3-642-03684-2 [contents] - 2008
- [j25]Sotiris E. Nikoletseas, José D. P. Rolim:
Preface. Theor. Comput. Sci. 402(1): 1 (2008) - [j24]Carme Àlvarez, Josep Díaz
High level communication functionalities for wireless sensor networks. Theor. Comput. Sci. 406(3): 240-247 (2008) - [c39]Luminita Moraru
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks. ADHOC-NOW 2008: 148-161 - [c38]Michael N. Kalochristianakis, Vasileios Gkamas, Georgios Mylonas
The Design of an Open and Integrated Sensor Network Management Platform. APNOMS 2008: 495-498 - [c37]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 - [e22]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. Lecture Notes in Computer Science 5171, Springer 2008, ISBN 978-3-540-85362-6 [contents] - [r1]Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Randomized Energy Balance Algorithms in Sensor Networks. Encyclopedia of Algorithms 2008 - [i11]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) - 2007
- [j23]Olivier Powell, Pierre Leone, José D. P. Rolim:
Energy optimal data propagation in wireless sensor networks. J. Parallel Distributed Comput. 67(3): 302-317 (2007) - [c36]Ioannis Chatzigiannakis
Fast and energy efficient sensor data collection by multiple mobile sinks. MOBIWAC 2007: 25-32 - [c35]Luminita Moraru
Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms. Q2SWinet 2007: 31-38 - [e21]Moses Charikar
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. Lecture Notes in Computer Science 4627, Springer 2007, ISBN 978-3-540-74207-4 [contents] - 2006
- [j22]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 J. Exp. Algorithmics 11 (2006) - [j21]Charilaos Efthymiou, Sotiris E. Nikoletseas, José D. P. Rolim:
Energy balanced data propagation in wireless sensor networks. Wirel. Networks 12(6): 691-707 (2006) - [c34]Pierre Leone, Luminita Moraru
Localization Algorithm for Wireless Ad-Hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition. ALGOSENSORS 2006: 119-129 - [c33]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 - [c32]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 - [e20]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. Lecture Notes in Computer Science 4240, Springer 2006, ISBN 3-540-69085-9 [contents] - [e19]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. Lecture Notes in Computer Science 4110, Springer 2006, ISBN 3-540-38044-2 [contents] - 2005
- [j20]Sotiris E. Nikoletseas, José D. P. Rolim:
Preface. Theor. Comput. Sci. 344(1): 1-2 (2005) - [j19]Pierre Leone, José D. P. Rolim:
Towards a dynamical model for wireless sensor networks. Theor. Comput. Sci. 344(1): 69-85 (2005) - [c31]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 - [c30]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 - [e18]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. Lecture Notes in Computer Science 3624, Springer 2005, ISBN 3-540-28239-4 [contents] - [i10]Pierre Leone, Olivier Powell, José D. P. Rolim:
Energy Optimal Data Propagation in Wireless Sensor Networks. CoRR abs/cs/0508052 (2005) - [i9]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) - 2004
- [c29]Pierre Leone, José D. P. Rolim:
Towards a Dynamical Model for Wireless Sensor Networks. ALGOSENSORS 2004: 98-108 - [c28]Charilaos Efthymiou, Sotiris E. Nikoletseas, José D. P. Rolim:
Energy Balanced Data Propagation in Wireless Sensor Networks. IPDPS 2004 - [c27]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 - [c26]Claude Tadonki, José D. P. Rolim:
An Analytical Model for Energy Minimization. WEA 2004: 559-569 - [e17]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. Lecture Notes in Computer Science 3122, Springer 2004, ISBN 3-540-22894-2 [contents] - 2003
- [c25]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 - [c24]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 - [e16]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, NJ, USA, August 24-26, 2003, Proceedings. Lecture Notes in Computer Science 2764, Springer 2003, ISBN 3-540-40770-7 [contents] - [e15]Klaus Jansen, Marian Margraf, Monaldo Mastrolilli
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings. Lecture Notes in Computer Science 2647, Springer 2003, ISBN 3-540-40205-5 [contents] - 2002
- [e14]José D. P. Rolim, Salil P. Vadhan:
Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings. Lecture Notes in Computer Science 2483, Springer 2002, ISBN 3-540-44147-6 [contents] - 2001
- [j18]Klaus Jansen, José D. P. Rolim:
Guest Editors' Introduction. Algorithmica 30(3): 351-352 (2001) - [e13]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. Lecture Notes in Computer Science 2129, Springer 2001, ISBN 3-540-42470-9 [contents] - 2000
- [c23]Andreas Dandalis, Viktor K. Prasanna, José D. P. Rolim:
A Comparative Study of Performance of AES Final Candidates Using FPGAs. CHES 2000: 125-140 - [c22]Andreas Dandalis, Viktor K. Prasanna, José D. P. Rolim:
An Adaptive Cryptographic Engine for IPSec Architectures. FCCM 2000: 132-144 - [c21]Danuta Sosnowska, José D. P. Rolim:
Fleet Scheduling Optimization: A Simulated Annealing Approach. PATAT 2000: 227-242 - [e12]Ugo Montanari, José D. P. Rolim, Emo Welzl:
Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Lecture Notes in Computer Science 1853, Springer 2000, ISBN 3-540-67715-1 [contents] - [e11]José D. P. Rolim, Andrei Z. Broder, Andrea Corradini, Roberto Gorrieri, Reiko Heckel, Juraj Hromkovic, Ugo Vaccaro, J. B. Wells:
ICALP Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000. Carleton Scientific, Waterloo, Ontario, Canada 2000, ISBN 1-894145-07-0 [contents] - [e10]José D. P. Rolim:
Parallel and Distributed Processing, 15 IPDPS 2000 Workshops, Cancun, Mexico, May 1-5, 2000, Proceedings. Lecture Notes in Computer Science 1800, Springer 2000, ISBN 3-540-67442-X [contents] - [i8]Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim:
Parallel Read Operations Without Memory Contention. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j17]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) - [j16]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) - [c20]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 - [c19]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 - [e9]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 C. 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. Lecture Notes in Computer Science 1586, Springer 1999, ISBN 3-540-65831-9 [contents] - [e8]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. Lecture Notes in Computer Science 1671, Springer 1999, ISBN 3-540-66329-0 [contents] - 1998
- [j15]José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto:
Bisecting De Bruijn and Kautz Graphs. Discret. Appl. Math. 85(1): 87-97 (1998) - [j14]Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Recent Advances Towards Proving P = BPP. Bull. EATCS 64 (1998) - [j13]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
A New General Derandomization Method. J. ACM 45(1): 179-213 (1998) - [j12]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) - [j11]Pavol Duris, José D. P. Rolim:
Lower Bounds on the Multiparty Communication Complexity. J. Comput. Syst. Sci. 56(1): 90-95 (1998) - [j10]Afonso Ferreira, José D. P. Rolim:
Special Issue on Irregular Problems in Supercomputing Applications: Guest Editors' Introduction. J. Parallel Distributed Comput. 50(1/2): 1-2 (1998) - [j9]Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi
The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998) - [c18]Klaus Jansen, José D. P. Rolim:
Algorithms Based on Randomization and Linear and Semidefinite Programming. SOFSEM 1998: 124-134 - [e7]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. Lecture Notes in Computer Science 1388, Springer 1998, ISBN 3-540-64359-1 [contents] - [e6]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. Lecture Notes in Computer Science 1457, Springer 1998, ISBN 3-540-64809-7 [contents] - [e5]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. Lecture Notes in Computer Science 1518, Springer 1998, ISBN 3-540-65142-X [contents] - 1997
- [j8]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) - [c17]José D. P. Rolim, Luca Trevisan:
A case study of de-randomization methods for combinatorial approximation algorithms. Network Design: Connectivity and Facilities Location 1997: 319-334 - [c16]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 - [c15]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 - [c14]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 - [c13]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 - [e4]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. Lecture Notes in Computer Science 1253, Springer 1997, ISBN 3-540-63138-0 [contents] - [e3]José D. P. Rolim:
Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings. Lecture Notes in Computer Science 1269, Springer 1997, ISBN 3-540-63248-4 [contents] - [i7]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Weak Random Sources, Hitting Sets, and BPP Simulations. Electron. Colloquium Comput. Complex. TR97 (1997) - [i6]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. Electron. Colloquium Comput. Complex. TR97 (1997) - [i5]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. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j7]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) - [j6]Afonso Ferreira, José D. P. Rolim:
Foreword to the Special Issue on Parallelism. Theor. Comput. Sci. 162(2): 171-172 (1996) - [c12]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Hitting Sets Derandomize BPP. ICALP 1996: 357-368 - [c11]Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki:
Distributing Tokens on a Hypercube without Error Accumulation. IPPS 1996: 573-578 - [c10]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 - [c9]Andrea Clementi, José D. P. Rolim, Erik Urland:
Randomized parallel algorithms. Solving Combinatorial Optimization Problems in Parallel 1996: 25-50 - [c8]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 - [e2]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. Lecture Notes in Computer Science 1117, Springer 1996, ISBN 3-540-61549-0 [contents] - [i4]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Towards efficient constructions of hitting sets that derandomize BPP. Electron. Colloquium Comput. Complex. TR96 (1996) - [i3]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Hitting Properties of Hard Boolean Operators and their Consequences on BPP. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [c7]Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi
The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141 - [c6]José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto:
Bisecting de Bruijn and Kautz Graphs. SIROCCO 1995: 211-222 - [c5]Pavol Duris, José D. P. Rolim:
Optimal Lower Bounds on the Multiparty Communication Complexity. STACS 1995: 350-360 - [c4]José D. P. Rolim, Ondrej Sýkora, Imrich Vrto:
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. WG 1995: 252-264 - [e1]Afonso Ferreira, José D. P. Rolim:
Parallel Algorithms for Irregularly Structured Problems, Second International Workshop, IRREGULAR '95, Lyon, France, September 4-6, 1995, Proceedings. Lecture Notes in Computer Science 980, Springer 1995, ISBN 3-540-60321-2 [contents] - [i2]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Hitting Sets Derandomize BPP. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j5]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) - [j4]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) - [c3]Pavol Duris, José D. P. Rolim:
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. MFCS 1994: 38-51 - 1992
- [c2]José D. P. Rolim:
On the Density and Core of the Complexity Classes. LATIN 1992: 448-459 - 1990
- [c1]José D. P. Rolim:
On the Formal Aspects of Approximation Algorithms. ICCI 1990: 24-33
1980 – 1989
- 1989
- [j3]José D. P. Rolim, Sheila A. Greibach:
A Note on the Best-Case Complexity. Inf. Process. Lett. 30(3): 133-138 (1989) - [j2]José D. P. Rolim:
On the Polynomial IO-Complexity. Inf. Process. Lett. 33(4): 199-204 (1989) - 1988
- [j1]José D. P. Rolim, Sheila A. Greibach:
On the IO-Complexity and Approximation Languages. Inf. Process. Lett. 28(1): 27-31 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: