Exact Sampling in Machine Scheduling Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On Approximating the Number of Bases of Exchange Preserving Matroids
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Shuffling biological sequences with motif constraints
Journal of Discrete Algorithms
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Ant Colony Optimization and the Minimum Spanning Tree Problem
Learning and Intelligent Optimization
A Generic Distributed Algorithm for Computing by Random Mobile Agents
Agent Computing and Multi-Agent Systems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Longest common subsequence as private search
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Reconstructing the topology of protein complexes
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Ant Colony Optimization and the minimum spanning tree problem
Theoretical Computer Science
Combinatorial problems arising in SNP and haplotype analysis
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Efficient distributed random walks with applications
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
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Limiting the spread of misinformation in social networks
Proceedings of the 20th international conference on World wide web
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Random walks in distributed computing: a survey
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Diameter of random spanning trees in a given graph
Journal of Graph Theory
Chip-firing games, potential theory on graphs, and spanning trees
Journal of Combinatorial Theory Series A
Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails
IEEE/ACM Transactions on Networking (TON)
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Random spanning trees and the prediction ofweighted graphs
The Journal of Machine Learning Research
Radio cover time in hyper-graphs
Ad Hoc Networks
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...