Author of the publication

Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification.

. STACS, volume 210 of Lecture Notes in Computer Science, page 73-86. Springer, (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Unbounded Speed Variability in Distributed Communications Systems., and . SIAM J. Comput., 14 (1): 75-92 (1985)The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases., and . ICCI, page 403-407. IEEE Computer Society, (1993)MaxMin Fair Flow Control Sensitive to Priorities., , and . OPODIS, page 45-60. Hermes, (1998)Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps., , and . Inf. Process. Lett., 58 (1): 47-53 (1996)Randomized Approximation Techniques., and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Atomic Selfish Routing in Networks., and . Handbook of Parallel Computing, Chapman and Hall/CRC, (2007)The Complexity of The Reliable Connectivity Problem., , and . MFCS, volume 520 of Lecture Notes in Computer Science, page 259-266. Springer, (1991)On the Chromatic Number of Non-Sparse Random Intersection Graphs., , and . Theory Comput. Syst., 60 (1): 112-127 (2017)Probabilistic Data Propagation in Wireless Sensor Networks., and . Theoretical Aspects of Distributed Computing in Sensor Networks, Springer, (2011)Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs., , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 728-739. Springer, (2012)