MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Michael Bender" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

76 documents found, showing 1 through 10. Next 10 →

ATOM

An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
by Chandra Chekuri, Michael Bender — 1999 — Journal of Algorithms
… Chandra Chekuri y Michael Bender z July 4, 1999 Abstract We give a new efficient approximation…
Cited by 17 (3 self) – Add To MetaCart

The power of team exploration: Two robots can learn unlabeled directed graphs
by Michael A. Bender — 1994 — In Proceedings of the Thirty Fifth Annual Symposium on Foundations of Computer Science
…The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs Michael A. Bender…
Cited by 45 (5 self) – Add To MetaCart

Flow and Stretch Metrics for Scheduling Continuous Job Streams
by Michael Bender, Soumen Chakrabarti, S. Muthukrishnan — 1998 — In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms
…Flow and Stretch Metrics for Scheduling Continuous Job Streams Michael A. Bender Soumen…
Cited by 91 (9 self) – Add To MetaCart

The LCA Problem Revisited
by Michael Bender Suny, Michael A. Bender, Martn Farach-colton — 2000
…The LCA Problem Revisited Michael A. Bender SUNY Stony Brook Martn Farach-Colton y Rutgers…
Add To MetaCart

Fault Tolerant Data Structures
by Yonatan Aumann, Michael A. Bender — 1996
…Fault Tolerant Data Structures Yonatan Aumann Michael A. Bender y Abstract We consider…
Cited by 23 (1 self) – Add To MetaCart

Efficient Low-Contention Asynchronous Consensus with the Value-Oblivious Adversary Scheduler
by Yonatan Aumann, Yonatan Aumann, Michael A. Bender, Michael A. Bender — 2005 — Distributed Computing
… Aumann Michael A. Bender y Dept of Mathematics and Computer Science Dept of Computer Science Bar Ilan…
Cited by 4 (0 self) – Add To MetaCart

Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler
by Yonatan Aumann, Michael A. Bender — 1996 — Automata, Languages and Programming, 23rd International Colloquium, volume 1099 of Lecture Notes in Computer Science
… Michael A. Bender z Abstract We address the problem of asynchronous consensus. In view of the ~\Omega (n…
Cited by 15 (3 self) – Add To MetaCart

Testing Acyclicity of Directed Graphs in Sublinear Time
by Michael A. Bender, Dana Ron — 2000 — In Proceedings of ICALP
…Testing Acyclicity of Directed Graphs in Sublinear Time Michael A. Bender y SUNY Stony Brook…
Cited by 11 (5 self) – Add To MetaCart

The LCA problem revisited
by Michael A. Bender, Martín Farach-colton — 2000 — In Latin American Theoretical INformatics
…The LCA Problem Revisited Michael A. Bender 1⋆ and Martín Farach-Colton 2⋆⋆ 1 Department…
Cited by 99 (5 self) – Add To MetaCart

Performance Guarantees for the TSP with a Parameterized Triangle Inequality
by Michael A. Bender, Chandra Chekuri — 2000 — IN PROC. 6TH INT. WORKSHOP ON ALGORITHMS AND DATA STRUCTURES (WADS), VOLUME 1663 OF LECTURE NOTES IN COMPUT. SCI
…Performance Guarantees for the TSP with a Parameterized Triangle Inequality Michael A. Bender…
Cited by 6 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB