Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-Spanner Problems for k2
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Strong Inapproximability of the Basic k-Spanner Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Labeling Schemes for Dynamic Tree Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
Analysis of a randomized rendezvous algorithm
Information and Computation
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A note on efficient aggregate queries in sensor networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Distributed approximation: a survey
ACM SIGACT News
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Locally guided randomized elections in trees: the totally fair case
Information and Computation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Information dissemination in highly dynamic graphs
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Approximating k-spanner problems for k 2
Theoretical Computer Science
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The internet AS-level topology: three data sources and one definitive metric
ACM SIGCOMM Computer Communication Review
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Local heuristics and the emergence of spanning subgraphs in complex networks
Theoretical Computer Science - Complex networks
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Veracity radius: capturing the locality of distributed computations
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Deformable spanners and applications
Computational Geometry: Theory and Applications
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms
A note on efficient aggregate queries in sensor networks
Theoretical Computer Science
Local MST computation with short advice
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Local embeddings of metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed approximate matching
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Spanners for bounded tree-length graphs
Theoretical Computer Science
Barrier coverage with wireless sensors
Wireless Networks
Labeling schemes for weighted dynamic trees
Information and Computation
Embedding metric spaces in their intrinsic dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic multi-hop clustering for mobile hybrid wireless networks
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Roundtrip spanners and roundtrip routing in directed graphs
ACM Transactions on Algorithms (TALG)
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Adaptive multi-hop clustering in mobile networks
Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed packing in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Energy-optimal distributed algorithms for minimum spanning trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed selection: a missing piece of data aggregation
Communications of the ACM - Enterprise information integration: and other tools for merging data
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
Ad hoc networks beyond unit disk graphs
Wireless Networks
Distributed computation of the mode
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Monitoring schedules for randomly deployed sensor networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Local, distributed weighted matching on general and wireless topologies
Proceedings of the fifth international workshop on Foundations of mobile computing
Space efficient and time optimal distributed BFS tree construction
Information Processing Letters
The Maximum Energy-Constrained Dynamic Flow Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Distributed Disaster Disclosure
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Computing the Greedy Spanner in Near-Quadratic Time
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Computing Lightweight Spanners Locally
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Distributed Approximation of Cellular Coverage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On low dimensional local embeddings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
Theoretical Computer Science
Leader election algorithm using heap structure
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Discrete Applied Mathematics
Distributed Tree Rearrangements for Reachability and Robust Connectivity
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Information Processing Letters
Distributed vision with smart pixels
Proceedings of the twenty-fifth annual symposium on Computational geometry
Local Construction of Spanners in the 3-D Space
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Return of the primal-dual: distributed metric facilitylocation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: a note on distributed stable matching
Proceedings of the 28th ACM symposium on Principles of distributed computing
A DoS-resilient information system for dynamic data management
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Distributed Motion Constraints for Algebraic Connectivity of Robotic Networks
Journal of Intelligent and Robotic Systems
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ACM Transactions on Algorithms (TALG)
Deformable spanners and applications
Computational Geometry: Theory and Applications
Energy-optimal distributed algorithms for minimum spanning trees
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Global formation-shape stabilization of relative sensing networks
ACC'09 Proceedings of the 2009 conference on American Control Conference
Distributed Graph Traversals by Relabelling Systems with Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Locally guided randomized elections in trees: The totally fair case
Information and Computation
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Additive spanners for k-chordal graphs
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
On bootstrapping topology knowledge in anonymous networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Local edge colouring of Yao-like subgraphs of unit disk graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Topology control and geographic routing in realistic wireless networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Distributed approximation algorithms for finding 2-edge-connected subgraphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
A local distributed algorithm to approximate MST in unit disc graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient threshold detection in a distributed environment: extended abstract
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: a framework for building self-stabilizing overlay networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms
Discrete Applied Mathematics
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Theory of communication networks
Algorithms and theory of computation handbook
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Distributed algorithm for a color assignment on asynchronous rings
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Low memory distributed protocols for 2-coloring
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Improved local algorithms for spanner construction
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Bounded length, 2-edge augmentation of geometric planar graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Deterministic dominating set construction in networks with bounded degree
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Local 7-coloring for planar subgraphs of unit disk graphs
Theoretical Computer Science
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Xheal: localized self-healing using expanders
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Resilient and low stretch routing through embedding into tree metrics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Building self-stabilizing overlay networks with the transitive closure framework
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Efficient distributed handshake using mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Sensor networks: distributed algorithms reloaded – or revolutions?
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On spanners of geometric graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Labeling schemes for tree representation
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Shortest hop multipath algorithm for wireless sensor networks
Computers & Mathematics with Applications
Distributed approximation of cellular coverage
Journal of Parallel and Distributed Computing
Fault recovery in wireless networks: the geometric recolouring approach
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Distributed approximation algorithms for planar graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A fast distributed approximation algorithm for minimum spanning trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Max-stretch reduction for tree spanners
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Collective tree spanners and routing in AT-free related graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Minimum delay load-balancing via nonparametric regression and no-regret algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Compact and low delay routing labeling scheme for Unit Disk Graphs
Computational Geometry: Theory and Applications
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Node-Disjoint multipath spanners and their relationship with fault-tolerant spanners
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: maintaining large dense subgraphs on dynamic networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Composable reliability for asynchronous systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Improved local algorithms for spanner construction
Theoretical Computer Science
Super-fast distributed algorithms for metric facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Distributed algorithms for network diameter and girth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Deterministic local algorithms, unique identifiers, and fractional graph colouring
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Distributed approximations for packing in unit-disk graphs
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Knowledge, level of symmetry, and time of leader election
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Controller and estimator for dynamic networks
Information and Computation
Fast distributed computation in dynamic networks via random walks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
No sublogarithmic-time approximation scheme for bipartite vertex cover
DISC'12 Proceedings of the 26th international conference on Distributed Computing
"Tri, tri again": finding triangles and small subgraphs in a distributed setting
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Distributed 2-approximation algorithm for the semi-matching problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
ACM Computing Surveys (CSUR)
Journal of the ACM (JACM)
Spanders: Distributed spanning expanders
Science of Computer Programming
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
On the complexity of universal leader election
Proceedings of the 2013 ACM symposium on Principles of distributed computing
IRIS: a robust information system against insider dos-attacks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
Exploiting locality in distributed SDN control
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Optimal deterministic routing and sorting on the congested clique
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Efficient and robust data aggregation using untrusted infrastructure
Proceedings of the 6th International Conference on Security of Information and Networks
Learning a ring cheaply and fast
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Efficient computation of balanced structures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Fast distributed coloring algorithms for triangle-free graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Lower bounds for local approximation
Journal of the ACM (JACM)
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Building self-stabilizing overlay networks with the transitive closure framework
Theoretical Computer Science
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
Information Processing Letters
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |