"Hemaspaandra, Lane A." appeared in Books and Chapters

entries per page

Filter:

Showing 1 to 3 of 3 entries

Book	Author(s)	Year	Publisher
The Complexity Theory Companion	Lane A. Hemaspaandra; Mitsunori Ogihara	2002	Springer Berlin Heidelberg
Theory of Semi-Feasible Algorithms	Lane A. Hemaspaandra; Leen Torenvliet	2003	Springer Berlin Heidelberg
Complexity theory retrospective II /	Hemaspaandra, Lane A.; Selman, Alan L.	[1997], ©1997.	Springer,
Boook	Author(s)	Year	Publisher

Showing 1 to 3 of 3 entries

entries per page

Filter:

Showing 1 to 20 of 62 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
The Power of Self-Reducibility: Selectivity, Information, and Approximation	Lane A. Hemaspaandra	Complexity and Approximation: In Memory of Ker-I Ko	Ding-Zhu Du; Jie Wang	1st ed. 2020	Springer International Publishing
That Most Important Intersection	Lane A. Hemaspaandra	Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday	Hans-Joachim Böckenhauer; Dennis Komm; Walter Unger	1st ed. 2018	Springer International Publishing
Computational Politics: Electoral Systems	Edith Hemaspaandra; Lane A. Hemaspaandra	Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 Proceedings	Mogens Nielsen; Branislav Rovan	2000	Springer Berlin Heidelberg
Credimus	Edith Hemaspaandra; Lane A. Hemaspaandra	The Future of Economic Design: The Continuing Development of a Field as Envisioned by Its Researchers	Jean-François Laslier; Hervé Moulin; M. Remzi Sanver; William S. Zwicker	1st ed. 2019	Springer International Publishing
The Complexity of Manipulative Actions in Single-Peaked Societies	Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe	Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division	Jörg Rothe	1st ed. 2016	Springer Berlin Heidelberg
All Superlinear Inverse Schemes Are coNP-Hard	Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel	Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings	Jirí Fiala; Václav Koubek; Jan Kratochvíl	2004	Springer Berlin Heidelberg
A downward translation in the polynomial hierarchy	Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel	STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings	Rüdiger Reischuk; Michel Morvan	1997	Springer Berlin Heidelberg
Query order in the polynomial hierarchy	Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel	Fundamentals of Computation Theory: 11th International Symposium, FCT ' 97, Krakow, Poland, September 1-3, 1997. Proceedings	Bogdan S. Chlebus; Ludwik Czaja	1997	Springer Berlin Heidelberg
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP	Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe	Automata, Languages and Programming: 24th International Colloquium, ICALP' 97, Bologna, Italy, July 7 - 11, 1997, Proceedings	Pierpaolo Degano; Roberto Gorrieri; Alberto Marchetti-Spaccamela	1997	Springer Berlin Heidelberg
R 1−tt SN (NP) distinguishes robust many-one and Turing completeness	Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel	Algorithms and Complexity: Third Italian Conference, CIAC' 97, Rome, Italy, March 12-14, 1997, Proceedings	Giancarlo Bongiovanni; Daniel P. Bovet; Giuseppe Di Battista	1997	Springer Berlin Heidelberg
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries	Edith Hemaspaandra; Lane. A. Hemaspaandra; Harald Hempel	STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999 Proceedings	Christoph Meinel; Sophie Tison	1999	Springer Berlin Heidelberg
5 - Dodgson's Rule and Young's Rule	Ioannis Caragiannis; Edith Hemaspaandra; Lane A. Hemaspaandra	Handbook of Computational Social Choice	Felix Brandt; Vincent Conitzer; Ulle Endriss; Jérôme Lang; Ariel D. Procaccia; Hervé Moulin	2016-04	Cambridge University Press
More Natural Models of Electoral Control by Partition	Gábor Erdélyi; Edith Hemaspaandra; Lane A. Hemaspaandra	Algorithmic Decision Theory: 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings	Toby Walsh	1st ed. 2015	Springer International Publishing
Intersection suffices for Boolean hierarchy equivalence	Lane A. Hemaspaandra; Jörg Rothe	Computing and Combinatorics: First Annual International Conference, COCOON ' 95, Xi' an, China, August 24-26, 1995. Proceedings	Ding-Zhu Du; Ming Li	1995	Springer Berlin Heidelberg
The Complexity of Power-Index Comparison	Piotr Faliszewski; Lane A. Hemaspaandra	Algorithmic Aspects in Information and Management: 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings	Rudolf Fleischer; Jinhui Xu	2008	Springer Berlin Heidelberg
P-Selectivity, Immunity, and the Power of One Bit	Lane A. Hemaspaandra; Leen Torenvliet	SOFSEM 2006: Theory and Practice of Computer Science: 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings	Jirí Wiedermann; Gerard Tel; Jaroslav Pokorný; Mária Bieliková; Július Štuller	2006	Springer Berlin Heidelberg
Pseudorandom generators and the frequency of simplicity	Yenjo Han; Lane A. Hemaspaandra	STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995. Proceedings	Ernst W. Mayr; Claude Puech	1995	Springer Berlin Heidelberg
P-Immune Sets with Holes Lack Self-Reducibility Properties	Lane A. Hemaspaandra; Harald Hempel	Combinatorics, Computability and Logic: Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS’01)	C.S. Calude; M.J. Dinneen; S. Sburlan	2001	Springer London
Introduction to Semi-Feasible Computation	Lane A. Hemaspaandra; Leen Torenvliet	Theory of Semi-Feasible Algorithms	Lane A. Hemaspaandra; Leen Torenvliet	2003	Springer Berlin Heidelberg
Advice	Lane A. Hemaspaandra; Leen Torenvliet	Theory of Semi-Feasible Algorithms	Lane A. Hemaspaandra; Leen Torenvliet	2003	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 62 entries