Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Michael A.
Last name:	Bender
DBLP:	b/MichaelABender
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 93  

Select a publication
Show	Title	Venue	Rating	Date
	Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer. Maintaining Arrays of Contiguous Objects.	Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings 2009	(0)	2009
	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert. A new approach to incremental topological ordering.	Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009 2009	(0)	2009
	Michael A. Bender. From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering.	Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings 2009	(0)	2009
	Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman. The Worst Page-Replacement Policy.	Theory Comput. Syst. 2009, Volume 44	(0)	2009
	Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.	Algorithmica 2008, Volume 50	(0)	2008
	Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan. Improved bounds on sorting by length-weighted reversals.	J. Comput. Syst. Sci. 2008, Volume 74	(0)	2008
	Michael A. Bender, Raphaël Clifford, Kostas Tsichlas. Scheduling algorithms for procrastinators.	J. Scheduling 2008, Volume 11	(0)	2008
	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari. Optimal sparse matrix dense vector multiplication in the I/O-model.	SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007 2007	(0)	2007
	Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson. Cache-oblivious streaming B-trees.	SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007 2007	(0)	2007
	Michael A. Bender, Cynthia A. Phillips. Scheduling DAGs on asynchronous processors.	SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007 2007	(0)	2007
	Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman. The Worst Page-Replacement Policy.	Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings 2007	(0)	2007
	Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang. Optimal Cache-Oblivious Mesh Layouts	CoRR 2007, Volume 0	(0)	2007
	Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt. Sum-of-squares heuristics for bin packing and memory allocation.	ACM Journal of Experimental Algorithmics 2008, Volume 12	(0)	2007
	Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro. An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.	SIAM J. Comput. 2006, Volume 36	(0)	2007
	Harold N. Gabow, Michael A. Bender, Martin Farach-Colton. Introduction to SODA 2002 and 2003 special issue.	ACM Transactions on Algorithms 2007, Volume 3	(0)	2007
	Michael A. Bender, Haodong Hu. An adaptive packed-memory array.	ACM Trans. Database Syst. 2007, Volume 32	(0)	2007
	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert. Contention Resolution with Heterogeneous Job Sizes.	Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings 2006	(0)	2006
	Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul. Cache-oblivious string B-trees.	Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA 2006	(0)	2006
	Michael A. Bender, Haodong Hu. An adaptive packed-memory array.	Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA 2006	(0)	2006
	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk. The Snowblower Problem.	Algorithmic Foundation of Robotics VII, Selected Contributions of the Seventh International Workshop on the Algorithmic Foundations of Robotics, WAFR 2006, July 16-18, 2006, New York, NY, USA 2008	(0)	2006
	Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella. The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.	Algorithmica 2006, Volume 46	(0)	2006
	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk. The Snowblower Problem	CoRR 2006, Volume 0	(0)	2006
	Michael A. Bender, Raphaël Clifford, Kostas Tsichlas. Scheduling Algorithms for Procrastinators	CoRR 2006, Volume 0	(0)	2006
	Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro. Insertion Sort is O(n log n).	Theory Comput. Syst. 2006, Volume 39	(0)	2006
	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul. Concurrent cache-oblivious b-trees.	SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms, July 18-20, 2005, Las Vegas, Nevada, USA 2005	(0)	2005

Your query returned 93 matches in the database.