José D. P. Rolim

According to our database1, José D. P. Rolim authored at least 121 papers between 1988 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Every Schnyder drawing is a greedy embedding.
Theor. Comput. Sci., 2020

2019
Radiation Control Algorithms in Wireless Networks.
Proceedings of the Mission-Oriented Sensor Networks and Systems: Art and Science, 2019

User Incentivization in Mobile Crowdsensing Systems.
Proceedings of the Mission-Oriented Sensor Networks and Systems: Art and Science, 2019

2018
VIVO: A secure, privacy-preserving, and real-time crowd-sensing framework for the Internet of Things.
Pervasive and Mobile Computing, 2018

2017
Indoor Location for Smart Environments with Wireless Sensor and Actuator Networks.
Proceedings of the 42nd IEEE Conference on Local Computer Networks, 2017

Mobile Crowdsensing from a Selfish Routing Perspective.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Load Balancing Mechanisms to Regulate Costs and Quality in Mobile Crowdsensing Systems.
Proceedings of the 13th International Conference on Distributed Computing in Sensor Systems, 2017

Atomic Routing Mechanisms for Balance of Costs and Quality in Mobile Crowdsensing Systems.
Proceedings of the 13th International Conference on Distributed Computing in Sensor Systems, 2017

2016
Randomized Energy Balance Algorithms in Sensor Networks.
Encyclopedia of Algorithms, 2016

A Distributed Algorithm Using Path Dissemination for Publish-Subscribe Communication Patterns.
Proceedings of the 14th ACM International Symposium on Mobility Management and Wireless Access, 2016

Bounding Distributed Energy Balancing Schemes for WSNs via Modular Subgames.
Proceedings of the International Conference on Distributed Computing in Sensor Systems, 2016

Internet of Things, Crowdsourcing and Systemic Risk Management for Smart Cities and Nations: Initial insight from IoT Lab European Research project.
Proceedings of the 30th International Conference on Advanced Information Networking and Applications Workshops, 2016

A Service Based Architecture for Multidisciplinary IoT Experiments with Crowdsourced Resources.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 15th International Conference, 2016

Strategies for Wireless Recharging in Mobile Ad-Hoc Networks.
Proceedings of the Wireless Power Transfer Algorithms, 2016

2015
Design and evaluation of characteristic incentive mechanisms in Mobile Crowdsensing Systems.
Simulation Modelling Practice and Theory, 2015

Internet of Things and crowd sourcing - a paradigm change for the research on the Internet of Things.
Proceedings of the 2nd IEEE World Forum on Internet of Things, 2015

AIRWISE - An Airborne Wireless Sensor Network for Ambient Air Pollution Monitoring.
Proceedings of the SENSORNETS 2015, 2015

Traversal Strategies for Wireless Power Transfer in Mobile Ad-Hoc Networks.
Proceedings of the 18th ACM International Conference on Modeling, 2015


Towards a holistic federation of secure crowd-enabled IoT facilities.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

A user-enabled testbed architecture with mobile crowdsensing support for smart, green buildings.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Design and evaluation of a real-time locating system for wireless sensor networks.
J. Location Based Services, 2014

Biased sink mobility with adaptive stop times for low latency data collection in sensor networks.
Information Fusion, 2014

Characteristic utilities, join policies and efficient incentives in Mobile Crowdsensing Systems.
Proceedings of the 2014 IFIP Wireless Days, 2014

SCLD-ATP: Symmetric Coherent Link Degree, Adaptive Transmission Power Control for Wireless Sensor Networks.
Proceedings of the SENSORNETS 2014 - Proceedings of the 3rd International Conference on Sensor Networks, Lisbon, Portugal, 7, 2014

Symmetric Coherent Link Degree, Adaptive Throughput-Transmission Power for Wireless Sensor Networks.
Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems, 2014

2013
Quantitative Characterization of Randomly Roving Agents
CoRR, 2013

Low radiation paths in wireless networks pass along Voronoi diagram.
Proceedings of the 21st International Conference on Software, 2013

Symmetric-key encryption scheme based on the strong generating sets of permutation groups.
Proceedings of the 2013 IEEE International Conference on Pervasive Computing and Communications Workshops, 2013

Connectivity in obstructed wireless networks: from geometry to percolation.
Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2013

Syndesi: A Framework for Creating Personalized Smart Environments Using Wireless Sensor Networks.
Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems, 2013

2012
Virtual raw anchor coordinates: A new localization paradigm.
Theor. Comput. Sci., 2012

On the efficiency of routing in sensor networks.
J. Parallel Distrib. Comput., 2012

Multilateration: Methods For Clustering Intersection Points For Wireless Sensor Networks Localization With Distance Estimation Error.
CoRR, 2012

Fine-grained in-door localisation with wireless sensor networks.
Proceedings of the 10th ACM International Symposium on Mobility Management and Wireless Access, 2012

Evaluating design approaches for smart building systems.
Proceedings of the 9th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2012

Radiation Awareness in Three-Dimensional Wireless Sensor Networks.
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

Irida: A Real-Time Wireless Sensor Network Visualization Feedback Protocol.
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm.
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

2011
Energy-Balanced Data Propagation inWireless Sensor Networks.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Distributed Planarization and Local Routing Strategies in Sensor Networks
CoRR, 2011

Randomly Roving Agents in Wireless Sensor Networks
CoRR, 2011

Optimal data gathering paths and energy-balance mechanisms in wireless networks.
Ad Hoc Networks, 2011

Design and Evaluation of a Lightweight Tracking Algorithm using WSN.
Proceedings of the IEEE 8th International Conference on Mobile Adhoc and Sensor Systems, 2011

Energy Balance Mechanisms and Lifetime Optimization of Wireless Networks.
Proceedings of the Contemporary Computing - 4th International Conference, 2011

Work-in-progress: Efficient heuristics for low radiation paths in wireless sensor networks.
Proceedings of the Distributed Computing in Sensor Systems, 2011

Passive target tracking: Application with mobile devices using an indoors WSN Future Internet testbed.
Proceedings of the Distributed Computing in Sensor Systems, 2011

2010
Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles.
Wireless Communications and Mobile Computing, 2010

Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks.
Theory Comput. Syst., 2010

VRAC: Theory #1
CoRR, 2010

Data Propagation with Guaranteed Delivery for Mobile Networks.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Interference Minimization in Wireless Networks.
Proceedings of the IEEE/IFIP 8th International Conference on Embedded and Ubiquitous Computing, 2010

Coverage-Adaptive Random Walks for Fast Sensory Data Collection.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009
WSNGE: a platform for simulating complex wireless sensor networks supporting rich network visualization and online interactivity.
Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009, 2009

Near-optimal data propagation by efficiently advertising obstacle boundaries.
Proceedings of the 6th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2009

An open and integrated management platform for wireless sensor networks.
Proceedings of the International Symposium on Autonomous Decentralized Systems (ISADS 2009), 2009

Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Randomized Energy Balance Algorithms in Sensor Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

High level communication functionalities for wireless sensor networks.
Theor. Comput. Sci., 2008

Lighweight Target Tracking Using Passive Traces in Sensor Networks
CoRR, 2008

Efficient Tracking of Moving Targets by Passively Handling Traces in Sensor Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

The Design of an Open and Integrated Sensor Network Management Platform.
Proceedings of the Challenges for Next Generation Network Operations and Service Management, 2008

Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks.
Proceedings of the Ad-hoc, Mobile and Wireless Networks, 7th International Conference, 2008

2007
Energy optimal data propagation in wireless sensor networks.
J. Parallel Distrib. Comput., 2007

Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms.
Proceedings of the Q2SWinet'07, 2007

Fast and energy efficient sensor data collection by multiple mobile sinks.
Proceedings of the Fifth ACM International Workshop on Mobility Management & Wireless Access, 2007

2006
Energy balanced data propagation in wireless sensor networks.
Wireless Networks, 2006

A framework for probabilistic numerical evaluation of sensor networks: A case study of a localization protocol.
ACM Journal of Experimental Algorithmics, 2006

Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2006

Localization Algorithm for Wireless Ad-Hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005
Preface.
Theor. Comput. Sci., 2005

Towards a dynamical model for wireless sensor networks.
Theor. Comput. Sci., 2005

Gradient Based Routing in Wireless Sensor Networks: a Mixed Strategy
CoRR, 2005

An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2005

2004
An Analytical Model for Energy Minimization.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Efficient and reliable high level communication in randomly deployed wireless sensor networks.
Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004

2003
Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays.
Proceedings of the Personal Wireless Communications, IFIP-TC6 8th International Conference, 2003

2001
Guest Editors' Introduction.
Algorithmica, 2001

2000
Parallel Read Operations Without Memory Contention
Electronic Colloquium on Computational Complexity (ECCC), 2000

Fleet Scheduling Optimization: A Simulated Annealing Approach.
Proceedings of the Practice and Theory of Automated Timetabling III, 2000

An Adaptive Cryptographic Engine for IPSec Architectures.
Proceedings of the 8th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2000), 2000

A Comparative Study of Performance of AES Final Candidates Using FPGAs.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2000

1999
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs.
Theor. Comput. Sci., 1999

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines.
Proceedings of the STACS 99, 1999

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.
Proceedings of the Automata, 1999

1998
The Parallel Complexity of Approximating the High Degree Subgraph Problem.
Theor. Comput. Sci., 1998

Special Issue on Irregular Problems in Supercomputing Applications: Guest Editors' Introduction.
J. Parallel Distrib. Comput., 1998

Lower Bounds on the Multiparty Communication Complexity.
J. Comput. Syst. Sci., 1998

A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms.
J. Comb. Optim., 1998

A New General Derandomization Method.
J. ACM, 1998

Recent Advances Towards Proving P = BPP.
Bulletin of the EATCS, 1998

Bisecting De Bruijn and Kautz Graphs.
Discrete Applied Mathematics, 1998

Algorithms Based on Randomization and Linear and Semidefinite Programming.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

1997
Optimal Bounds for the Approximation of Boolean Functions and Some Applications.
Theor. Comput. Sci., 1997

Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs
Electronic Colloquium on Computational Complexity (ECCC), 1997

On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations
Electronic Colloquium on Computational Complexity (ECCC), 1997

Weak Random Sources, Hitting Sets, and BPP Simulations
Electronic Colloquium on Computational Complexity (ECCC), 1997

Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Efficient Construction of Hitting Sets for Systems of Linear Functions.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996
Foreword to the Special Issue on Parallelism.
Theor. Comput. Sci., 1996

Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS.
Theor. Comput. Sci., 1996

Hitting Properties of Hard Boolean Operators and their Consequences on BPP
Electronic Colloquium on Computational Complexity (ECCC), 1996

Towards efficient constructions of hitting sets that derandomize BPP
Electronic Colloquium on Computational Complexity (ECCC), 1996

Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware.
Proceedings of the STACS 96, 1996

Randomized parallel algorithms.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

On the Parallel Computation of Boolean Functions on Unrelated inputs.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Distributing Tokens on a Hypercube without Error Accumulation.
Proceedings of IPPS '96, 1996

1995
Hitting Sets Derandomize BPP
Electronic Colloquium on Computational Complexity (ECCC), 1995

Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Optimal Lower Bounds on the Multiparty Communication Complexity.
Proceedings of the STACS 95, 1995

1994
A Note on the Density of Oracle Decreasing Time-Space Complexity.
Theor. Comput. Sci., 1994

Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited.
Int. J. Found. Comput. Sci., 1994

E-Complete Sets Do Not Have Optimal Polynomial Time Approximations.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1992
On the Density and Core of the Complexity Classes.
Proceedings of the LATIN '92, 1992

1990
On the Formal Aspects of Approximation Algorithms.
Proceedings of the Advances in Computing and Information, 1990

1989
A Note on the Best-Case Complexity.
Inf. Process. Lett., 1989

On the Polynomial IO-Complexity.
Inf. Process. Lett., 1989

1988
On the IO-Complexity and Approximation Languages.
Inf. Process. Lett., 1988


  Loading...