Search results for "Michael A. Bender"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz	The Cost of Cache-Oblivious Searching.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert Endre Tarjan	A New Approach to Incremental Cycle Detection and Related Problems	CoRR	2011	DBLP BibTeX RDF
1	Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer	Maintaining Arrays of Contiguous Objects	CoRR	2011	DBLP BibTeX RDF
1	Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang	Optimal Cache-Oblivious Mesh Layouts.	Theory Comput. Syst.	2011	DBLP DOI BibTeX RDF
1	Michael A. Bender, Seth Gilbert	Guest Editorial: Parallelism in Algorithms and Architectures.	Theory Comput. Syst.	2011	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk	The snowblower problem.	Comput. Geom.	2011	DBLP DOI BibTeX RDF
1	Michael A. Bender, Seth Gilbert	Mutual Exclusion with O(log^2 Log n) Amortized Work.	FOCS	2011	DBLP DOI BibTeX RDF
1	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari	Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.	Theory Comput. Syst.	2010	DBLP DOI BibTeX RDF
1	Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul	Performance guarantees for B-trees with different-sized atomic keys.	PODS	2010	DBLP DOI BibTeX RDF	B-tree with different-sized keys, atomic keys, dynamic programming
1	Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman	The Worst Page-Replacement Policy.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Caching, Online algorithms, Competitive analysis, Page replacement
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert	A new approach to incremental topological ordering.	SODA	2009	DBLP DOI BibTeX RDF
1	Michael A. Bender	From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering.	SEA	2009	DBLP DOI BibTeX RDF
1	Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer	Maintaining Arrays of Contiguous Objects.	FCT	2009	DBLP DOI BibTeX RDF
1	Friedhelm Meyer auf der Heide, Michael A. Bender (eds.)	SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009	SPAA	2009	DBLP BibTeX RDF
1	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	DBLP DOI BibTeX RDF	Manhattan distance, Clustering, Approximation, Supercomputers, Communication cost, Processor allocation, Polynomial-time approximation scheme (PTAS)
1	Michael A. Bender, Raphaël Clifford, Kostas Tsichlas	Scheduling algorithms for procrastinators.	J. Scheduling	2008	DBLP DOI BibTeX RDF	Hit-the-highest-nail, Interval stretch, Procrastinate, Procrastinator, Sum-of-squares problem, NP-complete, Online scheduling, Stretch
1	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	DBLP DOI BibTeX RDF
1	Michael A. Bender, Haodong Hu	An adaptive packed-memory array.	ACM Trans. Database Syst.	2007	DBLP DOI BibTeX RDF	Adaptive packed-memory array, locality preserving, packed-memory array, rebalance, sequential file maintenance, sequential scan, sparse array, range query, cache oblivious
1	Harold N. Gabow, Michael A. Bender, Martin Farach-Colton	Introduction to SODA 2002 and 2003 special issue.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF
1	Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang	Optimal Cache-Oblivious Mesh Layouts	CoRR	2007	DBLP BibTeX RDF
1	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.	2007	DBLP DOI BibTeX RDF
1	Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt	Sum-of-squares heuristics for bin packing and memory allocation.	ACM Journal of Experimental Algorithmics	2007	DBLP DOI BibTeX RDF	Bin packing, memory allocation, sum of squares
1	Michael A. Bender, Cynthia A. Phillips	Scheduling DAGs on asynchronous processors.	SPAA	2007	DBLP DOI BibTeX RDF	asynchronous parallel computing, firing-squad scheduling, precedence-constrained scheduling, online scheduling
1	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	DBLP DOI BibTeX RDF	I/O-model, sparse matrix dense vector multiplication, lower bound, external memory algorithms
1	Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson	Cache-oblivious streaming B-trees.	SPAA	2007	DBLP DOI BibTeX RDF	buffered repository tree, cache-oblivious B-tree, cascading array, deamortized, lookahead array, shuttle tree
1	Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman	The Worst Page-Replacement Policy.	FUN	2007	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Michael A. Bender, Raphaël Clifford, Kostas Tsichlas	Scheduling Algorithms for Procrastinators	CoRR	2006	DBLP BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk	The Snowblower Problem	CoRR	2006	DBLP BibTeX RDF
1	Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro	Insertion Sort is O(n log n).	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert	Contention Resolution with Heterogeneous Job Sizes.	ESA	2006	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk	The Snowblower Problem.	WAFR	2006	DBLP DOI BibTeX RDF
1	Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul	Cache-oblivious string B-trees.	PODS	2006	DBLP DOI BibTeX RDF	cache oblivious string B-tree, locality preserving front compression, packed-memory array, rebalance, range query
1	Michael A. Bender, Haodong Hu	An adaptive packed-memory array.	PODS	2006	DBLP DOI BibTeX RDF	adaptive packed-memory array, locality preserving, packed-memory array, rebalance, sequential file maintenance, sequential scan, sparse array, range query, cache oblivious
1	Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin	Lowest common ancestors in trees and directed acyclic graphs.	J. Algorithms	2005	DBLP DOI BibTeX RDF
1	Yonatan Aumann, Michael A. Bender	Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler.	Distributed Computing	2005	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia	Optimal Covering Tours with Turn Costs.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
1	Michael A. Bender, Erik D. Demaine, Martin Farach-Colton	Cache-Oblivious B-Trees.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
1	Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (eds.)	Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004	Cache-Oblivious and Cache-Aware Algorithms	2005	DBLP BibTeX RDF
1	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.	WADS	2005	DBLP DOI BibTeX RDF
1	Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson	Adversarial contention resolution for simple channels.	SPAA	2005	DBLP DOI BibTeX RDF	exponential backoff, polynomial backoff, worst-case backoff performance, on-line, batch
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul	Concurrent cache-oblivious b-trees.	SPAA	2005	DBLP DOI BibTeX RDF	cache-oblivious b-tree, concurrent b-tree, exponential tree, packed-memory array, lock free, non-blocking
1	Michael A. Bender, Martin Farach-Colton	The Level Ancestor Problem simplified.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	Michael A. Bender, Saurabh Sethia, Steven Skiena	Data structures for maintaining set partitions.	Random Struct. Algorithms	2004	DBLP DOI BibTeX RDF
1	Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman	Approximation Algorithms for Average Stretch Scheduling.	J. Scheduling	2004	DBLP DOI BibTeX RDF	average stretch, approximation algorithms, Scheduling algorithms
1	Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu	A locality-preserving cache-oblivious dynamic dictionary.	J. Algorithms	2004	DBLP DOI BibTeX RDF
1	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 of Robots	CoRR	2004	DBLP BibTeX RDF
1	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	CoRR	2004	DBLP BibTeX RDF
1	Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro	Insertion Sort is O(n log n)	CoRR	2004	DBLP BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena	When can you fold a map?	Comput. Geom.	2004	DBLP DOI BibTeX RDF
1	Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan	Improved bounds on sorting with length-weighted reversals.	SODA	2004	DBLP DOI BibTeX RDF
1	Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson	Adversarial Analyses of Window Backoff Strategies.	IPDPS Next Generation Software Program - NSFNGS - PI Workshop	2004	DBLP DOI BibTeX RDF
1	Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt	The Robustness of the Sum-of-Squares Algorithm for Bin Packing.	ALENEX/ANALC	2004	DBLP BibTeX RDF
1	Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn	04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms.	Cache-Oblivious and Cache-Aware Algorithms	2004	DBLP BibTeX RDF
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson	On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs.	SPAA	2004	DBLP DOI BibTeX RDF	SP-bags, SP-hybrid, SP-order, least common ancestor, order maintenance, series-parallel, algorithm, parallel computing, data structure, graph, tree, mutual exclusion, thread, trace, locking, multi-threading, data race, work stealing, race detection, Cilk, parse tree, amortized analysis, fork-join, on the fly, dynamic set
1	Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter	Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity.	CPM	2004	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena	The Lazy Bureaucrat scheduling problem.	Inf. Comput.	2003	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia	Optimal Covering Tours with Turn Costs	CoRR	2003	DBLP BibTeX RDF
1	Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell	Online dispersion algorithms for swarms of robots.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	approximation algorithms, NP-hardness, swarm robotics
1	Esther M. Arkin, Michael A. Bender, Dongdong Ge	Improved approximation algorithms for the freeze-tag problem.	SPAA	2003	DBLP DOI BibTeX RDF	freeze-tag problem, minimum broadcast-time problem, minimum gossip time problem, multicast problem, scheduling, approximation algorithms, NP-hardness, TSP, data dissemination, swarm robotics, network optimization
1	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz	The Cost of Cache-Oblivious Searching.	FOCS	2003	DBLP DOI BibTeX RDF
1	Matthew Andrews, Michael A. Bender, Lisa Zhang	New Algorithms for Disk Scheduling.	Algorithmica	2002	DBLP DOI BibTeX RDF	Approximation algorithms, Disk scheduling, Asymmetric Traveling Salesman Problem
1	Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan	The Power of a Pebble: Exploring and Mapping Directed Graphs.	Inf. Comput.	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Dana Ron	Testing properties of directed graphs: acyclicity and connectivity.	Random Struct. Algorithms	2002	DBLP DOI BibTeX RDF
1	Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup	Efficient Tree Layout in a Multilevel Memory Hierarchy	CoRR	2002	DBLP BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena	The Lazy Bureaucrat Scheduling Problem	CoRR	2002	DBLP BibTeX RDF
1	Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell	Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments	CoRR	2002	DBLP BibTeX RDF
1	Michael A. Bender, Michael O. Rabin	Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton	Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy.	ESA	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito	Two Simplified Algorithms for Maintaining Order in a List.	ESA	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Erik D. Demaine, Martin Farach-Colton	Efficient Tree Layout in a Multilevel Memory Hierarchy.	ESA	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu	A locality-preserving cache-oblivious dynamic dictionary.	SODA	2002	DBLP DOI BibTeX RDF
1	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 of robots.	SODA	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman	Improved algorithms for stretch scheduling.	SODA	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Richard Cole, Rajeev Raman	Exponential Structures for Efficient Cache-Oblivious Algorithms.	ICALP	2002	DBLP DOI BibTeX RDF
1	Michael A. Bender, Martin Farach-Colton	The Level Ancestor Problem Simplified.	LATIN	2002	DBLP DOI BibTeX RDF
1	Vitus J. Leung, Esther M. Arkin, Michael A. Bender, David P. Bunde, Jeanette Johnston, Alok Lal, Joseph S. B. Mitchell, Cynthia A. Phillips, Steven S. Seiden	Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.	CLUSTER	2002	DBLP DOI BibTeX RDF
1	Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell	Analysis of Heuristics for the Freeze-Tag Problem.	SWAT	2002	DBLP DOI BibTeX RDF
1	Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro	Cache-oblivious priority queue and graph algorithm applications.	STOC	2002	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Michael A. Bender	An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia	Optimal covering tours with turn costs.	SODA	2001	DBLP DOI BibTeX RDF	m-guillotine subdivisions, lawn mowing, milling, turn costs, approximation algorithms, NP-completeness, traveling salesman problem (TSP), manufacturing, polynomial-time approximation scheme (PTAS), covering, NC machining
1	Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin	Finding least common ancestors in directed acyclic graphs.	SODA	2001	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena	When Can You Fold a Map?	WADS	2001	DBLP DOI BibTeX RDF
1	Michael A. Bender, Chandra Chekuri	Performance guarantees for the TSP with a parameterized triangle inequality.	Inf. Process. Lett.	2000	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena	When Can You Fold a Map?	CoRR	2000	DBLP BibTeX RDF
1	Michael A. Bender	A functional framework for efficient web-based scientific visualization systems.		2000	RDF
1	Michael A. Bender, Dana Ron	Testing Acyclicity of Directed Graphs in Sublinear Time.	ICALP	2000	DBLP DOI BibTeX RDF
1	Mie Sato, Ingmar Bitter, Michael A. Bender, Arie E. Kaufman, Masayuki Nakajima	TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons.	Pacific Conference on Computer Graphics and Applications	2000	DBLP DOI BibTeX RDF
1	Ingmar Bitter, Mie Sato, Michael A. Bender, Kevin T. McDonnell, Arie E. Kaufman, Ming Wan	CEASAR: a smooth, accurate and robust centerline extraction algorithm.	IEEE Visualization	2000	DBLP DOI BibTeX RDF
1	Michael A. Bender, Martin Farach-Colton	The LCA Problem Revisited.	LATIN	2000	DBLP DOI BibTeX RDF
1	Michael A. Bender, Saurabh Sethia, Steven Skiena	Data Structures for Maintaining Set Partitions.	SWAT	2000	DBLP DOI BibTeX RDF
1	Michael A. Bender, Michael O. Rabin	Scheduling Cilk multithreaded parallel programs on processors of different speeds.	SPAA	2000	DBLP DOI BibTeX RDF
1	Michael A. Bender, Erik D. Demaine, Martin Farach-Colton	Cache-Oblivious B-Trees.	FOCS	2000	DBLP DOI BibTeX RDF	cache-oblivious B-trees, dynamic search-tree data structures, optimal search bound, amortized memory transfers, computational complexity, memory hierarchy, cache storage, tree data structures, insertions, deletions, tree searching, hierarchical memory, worst-case bounds
1	Michael A. Bender, Chandra Chekuri	Performance Guarantees for the TSP with a Parameterized Triangle Inequality.	WADS	1999	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena	The Lazy Bureaucrat Scheduling Problem.	WADS	1999	DBLP DOI BibTeX RDF
1	Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan	Flow and Stretch Metrics for Scheduling Continuous Job Streams.	SODA	1998	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Michael A. Bender	An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.	IPCO	1998	DBLP DOI BibTeX RDF
1	Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan	The Power of a Pebble: Exploring and Mapping Directed Graphs.	STOC	1998	DBLP DOI BibTeX RDF
1	Yonatan Aumann, Michael A. Bender, Lisa Zhang	Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.	Inf. Comput.	1997	DBLP DOI BibTeX RDF
1	Yonatan Aumann, Michael A. Bender	Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler.	ICALP	1996	DBLP DOI BibTeX RDF

Publications of "Michael A. Bender" ( http://dblp.L3S.de/Authors/Michael_A._Bender )