Interpolation of symmetric functions and a new type of combinatorial design
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Geometric pattern matching: a performance study
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
Superimposed code based channel assignment in multi-radio multi-channel wireless mesh networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fighting censorship with algorithms
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Superselectors: efficient constructions and applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Faster deterministic wakeup in multiple access channels
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual are capacities. Our approach leads to an O(min(n/sup 2/3/, m/sup 1/2/)m log(n/sup 2//m) log U) ...