Author of the publication

Routing, Merging, and Sorting on Parallel Models of Computation.

, and . J. Comput. Syst. Sci., 30 (1): 130-145 (1985)

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

On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions., and . ACM Trans. Economics and Comput., 5 (1): 2 (2016)Equilibria of Greedy Combinatorial Auctions., and . SIAM J. Comput., 46 (2): 620-660 (2017)Budgetary Effects on Pricing Equilibrium in Online Markets., , and . CoRR, (2015)On the limitations of deterministic de-randomizations for online bipartite matching and max-sat., and . CoRR, (2016)On Relating Time and Space to Size and Depth.. SIAM J. Comput., 6 (4): 733-744 (1977)Can competitive analysis be made competitive?. CASCON, page 359-367. IBM, (1992)On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version), and . STOC, page 535-545. ACM, (1990)Elimination Graphs., and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 774-785. Springer, (2009)Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization., and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 528-539. Springer, (2014)Time Space Tradeoffs (Getting Closer to the Barrier?).. ISAAC, volume 762 of Lecture Notes in Computer Science, page 209-220. Springer, (1993)