Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Paths Problems in Symmetric Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03)
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Robotic Exploration, Brownian Motion and Electrical Resistance
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The role of information in the cop-robber game
Theoretical Computer Science
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Diversity-based inference of finite automata
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The Cover Time of Random Digraphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The hitting and cover times of random walks on finite graphs using local degree information
Theoretical Computer Science
The cover time of random geometric graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Multiple Random Walks and Interacting Particle Systems
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Proceedings of the 28th ACM symposium on Principles of distributed computing
How Well Do Random Walks Parallelize?
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Coping with uncertainty in map learning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Note: The hitting and cover times of Metropolis walks
Theoretical Computer Science
Impact of local topological information on random walks on finite graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Some observations on the computational complexity of graph accessibility problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Faster treasure hunt and better strongly universal exploration sequences
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Quantum walk based search algorithms
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
How to design a linear cover time random walk on a finite graph
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Radio cover time in hyper-graphs
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Complexity analysis of real-time reinforcement learning
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Spatial navigation with uncertain deviations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Speeding up random walks with neighborhood exploration
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A new method to automatically compute processing times for random walks based distributed algorithms
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Low memory distributed protocols for 2-coloring
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Accessing probabilistic quorums in dynamic networks
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
The evolution of the cover time
Combinatorics, Probability and Computing
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
The cover time of cartesian product graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The cover times of random walks on hypergraphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Incremental web-site boundary detection using random walks
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
DISC'11 Proceedings of the 25th international conference on Distributed computing
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Simulating undirected st-connectivity algorithms on uniform JAGs and NNJAGs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Topological adaptability for the distributed token circulation paradigm in faulty environment
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Stationary distribution and cover time of random walks on random digraphs
Journal of Combinatorial Theory Series B
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Decentralized resources management for grid
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
The reduced automata technique for graph exploration space lower bounds
Theoretical Computer Science
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Random walks in distributed computing: a survey
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
Mathematical and Computer Modelling: An International Journal
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
Span programs and quantum algorithms for st-connectivity and claw detection
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
Population size matters: rigorous runtime results for maximizing the hypervolume indicator
Proceedings of the 15th annual conference on Genetic and evolutionary computation
How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Nested clusters with intercluster routing
The Journal of Supercomputing
The cover times of random walks on random uniform hypergraphs
Theoretical Computer Science
Radio cover time in hyper-graphs
Ad Hoc Networks
| Hi-index | 0.01 |