The following pages link to José D. P. Rolim (Q582101):
Displaying 22 items.
- (Q455963) (redirect page) (← links)
- On the efficiency of routing in sensor networks (Q455964) (← links)
- On the polynomial IO-complexity (Q582102) (← links)
- Virtual raw anchor coordinates: a new localization paradigm (Q714768) (← links)
- Energy optimal data propagation in wireless sensor networks (Q869391) (← links)
- High level communication functionalities for wireless sensor networks (Q952445) (← links)
- On the IO-complexity and approximation languages (Q1112018) (← links)
- A note on the best-case complexity (Q1120281) (← links)
- Lower bounds on the multiparty communication complexity (Q1267715) (← links)
- A case study of de-randomization methods for combinatorial approximation algorithms (Q1282206) (← links)
- A note on the density of oracle decreasing time-space complexity (Q1334680) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Bisecting de Bruijn and Kautz graphs (Q1392548) (← links)
- Stochastic models and adaptive algorithms for energy balance in sensor networks (Q1959380) (← links)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs (Q1960516) (← links)
- Every Schnyder drawing is a greedy embedding (Q2286747) (← links)
- Towards a dynamical model for wireless sensor networks (Q2575093) (← links)
- (Q2779814) (← links)
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164) (← links)
- Efficient constructions of Hitting Sets for systems of linear functions (Q5048940) (← links)
- The parallel complexity of approximating the High Degree Subgraph problem (Q6487954) (← links)
