Download publist.pdf

Contents : LIST OF PUBLICATIONS January 7 2013 Lane A. Hemaspaandra (born Lane A. Hemachandra) BOOKS 1. Theory of Semi-Feasible Algorithms L. Hemaspaandra and L. Torenvliet Monographs in Theoretical Computer Science an EATCS Series Springer-Verlag softcover edition (original edition is entry 3) ISBN 3-642-07581-0 2010. 2. The Complexity Theory Companion L. Hemaspaandra and M. Ogihara Texts in Theoretical Computer Science an EATCS Series Springer-Verlag softcover edition (original edition is entry 4) ISBN 3-642-08684-7 2010. 3. Theory of Semi-Feasible Algorithms L. Hemaspaandra and L. Torenvliet Monographs in Theoretical Computer Science an EATCS Series Springer-Verlag hardcover ISBN 3-54042200-5 2003. 4. The Complexity Theory Companion L. Hemaspaandra and M. Ogihara Texts in Theoretical Computer Science an EATCS Series Springer-Verlag hardcover ISBN 3-54067419-5 2002. 5. Complexity Theory Retrospective II L. Hemaspaandra and A. Selman editors Springer-Verlag ISBN 0-387-94973-9 1997. BOOK CHAPTERS 6. Computational Aspects of Approval Voting D. Baumeister G. Erd elyi E. Hemaspaandra L. Hemaspaandra and J. Rothe in Handbook on Approval Voting eds. J. Laslier and M. Sanver Springer pp. 199 251 2010. 7. A Richer Understanding of the Complexity of Election Systems P. Faliszewski E. Hemaspaandra L. Hemaspaandra and J. Rothe in Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz eds. S. Ravi and S. Shukla Springer pp. 375 406 2009. 8. Complexity Classes L. Hemaspaandra in Handbook of Discrete and Combinatorial Mathematics ed. K. Rosen CRC Press pp. 1085 1090 2000. 9. Witness-Isomorphic Reductions and Local Search S. Fischer L. Hemaspaandra and L. Torenvliet in Complexity Logic and Recursion Theory ed. A. Sorbi Marcel Dekker Inc. pp. 207 223 1997. 10. Promises and Fault-Tolerant Database Access J. Cai L. Hemachandra and J. Vysko c in Complexity Theory: Current Research eds. K. Ambos-Spies S. Homer and U. Sch oning Cambridge University Press pp. 101 146 1993. 1 11. Reductions to Sets of Low Information Content V. Arvind Y. Han L. Hemachandra J. K obler A. Lozano M. Mundhenk M. Ogiwara U. Sch oning R. Silvestri and T. Thierauf in Complexity Theory: Current Research eds. K. Ambos-Spies S. Homer and U. Sch oning Cambridge University Press pp. 1 45 1993. 12. Is #P Closed Under Subtraction L. Hemachandra and M. Ogiwara in Current Trends in Theoretical Computer Science: Essays and Tutorials eds. G. Rozenberg and A. Salomaa World Scientific pp. 523 536 1993. REFEREED JOURNAL PUBLICATIONS 13. Three Hierarchies of Simple Games Parameterized by "Resource" Parameters T. Gvozdeva L. Hemaspaandra and A. Slinko to appear in International Journal of Game Theorem. (Precursor workshop version appears in Proceedings of the Third International Workshop on Computational Social Choice (COMSOC 2010) pp. 259 270 D usseldorf University Press September 2010.) 14. The Shield that Never Was: Societies with Single-Peaked Preferences Are More Open to Manipulation and Control P. Faliszewski E. Hemaspaandra L. Hemaspaandra and J. Rothe Information and Computation V. 209 #2 pp. 89 107 February 2011. 15. Multimode Control Attacks on Elections P. Faliszewski E. Hemaspaandra and L. Hemaspaandra Journal of Artificial Intelligence Research V. 40 pp. 305 351 January 2011. 16. Using Complexity to Protect Elections P. Faliszewski E. Hemaspaandra and L. Hemaspaandra Communications of the ACM V. 53 #11 pp. 74 82 November 2010. 17. On the Complexity of Kings E. Hemaspaandra L. Hemaspaandra T. Tantau and O. Watanabe Theoretical Computer Science V. 411 #4 5 pp. 783 798 January 2010. 18. Generalized Juntas and NP-Hard Sets G. Erd elyi L. Hemaspaandra J. Rothe and H. Spakowski Theoretical Computer Science V. 410 #38 40 pp. 3995 4000 September 2009. 19. Hybrid Elections Broaden Complexity-Theoretic Resistance to Control E. Hemaspaandra L. Hemaspaandra and J. Rothe Mathematical Logic Quarterly V. 55 #4 pp. 397 424 August 2009. 20. Guarantees for the Success Frequency of an Algorithm for Finding DodgsonElection Winners C. Homan and L. Hemaspaandra Journal of Heuristics V. 15 #4 pp. 403 423 August 2009. 21. How Hard Is Bribery in Elections P. Faliszewski E. Hemaspaandra and L. Hemaspaandra Journal of Artificial Intelligence Research V. 35 pp. 485 532 July 2009. 22. Frequency of Correctness versus Average Polynomial Time G. Erd elyi L. Hemaspaandra J. Rothe and H. Spakowski Information Processing Letters V. 109 #16 pp. 946 949 July 2009. 2 23. Llull and Copeland Voting Computationally Resist Bribery and Control P. Faliszewski E. Hemaspaandra L. Hemaspaandra and J. Rothe Journal of Artificial Intelligence Research V. 35 pp. 275 341 June 2009. 24. The Complexity of Power-Index Comparison P. Faliszewski and L. Hemaspaandra Theoretical Computer Science V. 410 #1 pp. 101 107 January 2009. 25. Enforcing and Defying Associativity Commutativity Totality and Strong Noninvertibility for Worst-Case One-Way Functions L. Hemaspaandra J. Rothe and A. Saxena Theoretical Computer Science V. 401 #1 3 pp. 27 35 July 2008. 26. The Consequences of Eliminating NP Solutions P. Faliszewski and L. Hemaspaandra Computer Science Review V. 2 #1 pp. 40 54 April 2008. 27. Query-Monotonic Turing Reductions L. Hemaspaandra and M. Thakur Theoretical Computer Science V. 383 #2 3 pp. 153 186 September 2007. 28. Cluster Computing and the Power of Edge Recognition L. Hemaspaandra C. Homan and S. Kosub Information and Computation V. 205 #8 pp. 1274 1293 August 2007. 29. Anyone but Him: The Complexity of Precluding an Alternative E. Hemaspaandra L. Hemaspaandra and J. Rothe Artificial Intelligence V. 171 #5 6 pp. 255 285 April 2007. 30. Dichotomy for Voting Systems E. Hemaspaandra and L. Hemaspaandra Journal of Computer and System Sciences V. 73 #1 pp. 73 83 February 2007. 31. Complexity Results in Graph Reconstruction E. Hemaspaandra L. Hemaspaandra S. Radziszowski and R. Tripathi Discrete Applied Mathematics V. 155 #2 pp. 103 118 January 2007. 32. The Complexity of Computing the Size of an Interval L. Hemaspaandra C. Homan S. Kosub and K. Wagner SIAM Journal on Computing V. 36 #5 pp. 1264 1300 December 2006. 33. If P NP then Some Strongly Noninvertible Functions are Invertible L. Hemaspaandra K. Pasanen and J. Rothe Theoretical Computer Science V. 362 #1 3 pp. 54 62 October 2006. 34. The Complexity of Finding Top-Toda-Equivalence-Class Members L. Hemaspaandra M. Ogihara M. Zaki and M. Zimand Theory of Computing Systems V. 39 #5 pp. 669 684 September/October 2006. 35. Context-Free Languages Can Be Accepted with Absolutely No Space Overhead L. Hemaspaandra P. Mukherji and T. Tantau Information and Computation V. 203 #2 pp. 163 180 December 2005. 36. All Superlinear Inverse Schemes Are coNP-Hard E. Hemaspaandra L. Hemaspaandra and H. Hempel Theoretical Computer Science V. 345 #2 3 pp. 345 358 November 2005. 37. Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties P. Faliszewski and L. Hemaspaandra International Journal of Foundations of Computer Science V. 16 #5 pp. 913 928 October 2005. 3 38. Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries E. Hemaspaandra L. Hemaspaandra and H. Hempel SIAM Journal on Computing V. 34 #6 pp. 1352 1369 July 2005. 39. Competing Provers Yield Improved Karp Lipton Collapse Results J. Cai V. Chakaravarthy L. Hemaspaandra and M. Ogihara Information and Computation V. 198 #1 pp. 1 23 April 2005. 40. Lower Bounds and the Hardness of Counting Properties L. Hemaspaandra and M. Thakur Theoretical Computer Science V. 326 #1 3 pp. 1 28 October 2004. 41. Algebraic Properties for Selector Functions L. Hemaspaandra H. Hempel and A. Nickelsen SIAM Journal on Computing V. 33 #6 pp. 1309 1337 August 2004. 42. P-Immune Sets with Holes Lack Self-Reducibility Properties L. Hemaspaandra and H. Hempel Theoretical Computer Science V. 302 #1 3 pp. 457 466 June 2003. 43. Almost-Everywhere Superiority for Quantum Polynomial Time E. Hemaspaandra L. Hemaspaandra and M. Zimand Information and Computation V. 175 #2 pp. 171 181 June 2002. 44. On Characterizing of the Existence of Partial One-Way Permutations J. Rothe and L. Hemaspaandra Information Processing Letters V. 82 #3 pp. 165 171 May 2002. 45. Reducing the Number of Solutions of NP Functions L. Hemaspaandra M. Ogihara and G. Wechsung Journal of Computer and System Sciences V. 64 #2 pp. 311 328 March 2002. 46. Optimal Series-Parallel Tradeoffs for Reducing a Function to its Own Graph R. Beigel L. Hemaspaandra H. Hempel and J. Vogel Information and Computation V. 173 #2 pp. 123-131 March 2002. 47. A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem L. Hemaspaandra and J. Rothe Theoretical Computer Science V. 244 #1 2 pp. 205 217 August 2000. 48. Characterizing of the Existence of One-Way Permutations L. Hemaspaandra and J. Rothe Theoretical Computer Science V. 244 #1 2 pp. 257 261 August 2000. 49. Restrictive Acceptance Suffices for Equivalence Problems B. Borchert L. Hemaspaandra and J. Rothe London Mathematical Society Journal of Computation and Mathematics V. 3 pp. 86 95 March 2000. 50. A Note on Bounded-Weight Error-Correcting Codes R. Bent M. Schear L. Hemaspaandra and G. Istrate Journal of Universal Computer Science V. 5 #12 pp. 817 827 December 1999. 51. Robust Reductions J. Cai L. Hemaspaandra and G. Wechsung Theory of Computing Systems V. 32 #6 pp. 625 647 November/December 1999. 52. Self-Specifying Machines L. Hemaspaandra H. Hempel and G. Wechsung International Journal of Foundations of Computer Science V. 10 #3 pp. 263 276 September 1999. 4 53. Creating Strong Total Commutative Associative One-Way Functions from Any One-Way Function in Complexity Theory L. Hemaspaandra and J. Rothe Journal of Computer and System Sciences V. 58 #3 pp. 648 659 June 1999. 54. A Downward Collapse within the Polynomial Hierarchy E. Hemaspaandra L. Hemaspaandra and H. Hempel SIAM Journal on Computing V. 28 #2 pp. 383 393 April 1999. 55. Query Order L. Hemaspaandra H. Hempel and G. Wechsung SIAM Journal on Computing V. 28 #2 pp. 637 651 April 1999. 56. Boolean Operations Joins and the Extended Low Hierarchy L. Hemaspaandra Z. Jiang J. Rothe and O. Watanabe Theoretical Computer Science V. 205 #1 2 pp. 317 327 September 1998. 57. Power Balance and Apportionment Algorithms for the United States Congress L. Hemaspaandra K. Rajasethupathy P. Sethupathy and M. Zimand ACM Journal of Experimental Algorithmics V. 3 #1 16pp. URI www.jea.acm.org/1998/HemaspaandraPower August 1998. 58. A Note on Linear-Nondeterminism Linear-Sized Karp-Lipton Advice for the P-Selective Sets L. Hemaspaandra C. Nasipak and K. Parkins Journal of Universal Computer Science V. 4 #8 pp. 670 674 August 1998. 59. Query Order and the Polynomial Hierarchy E. Hemaspaandra L. Hemaspaandra and H. Hempel Journal of Universal Computer Science V. 4 #6 pp. 574 588 June 1998. 60. RSN 1-tt (NP) Distinguishes Robust Many-One and Turing Completeness E. Hemaspaandra L. Hemaspaandra and H. Hempel Theory of Computing Systems V. 31 #3 pp. 307 325 May/June 1998. 61. Universally Serializable Computation L. Hemaspaandra and M. Ogihara Journal of Computer and System Sciences V. 55 #3 pp. 547 560 December 1997. 62. Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP E. Hemaspaandra L. Hemaspaandra and J. Rothe Journal of the ACM V. 44 #6 pp. 806 825 November 1997. 63. Easy Sets and Hard Certificate Schemes L. Hemaspaandra J. Rothe and G. Wechsung Acta Informatica V. 34 #11 pp. 859 879 November 1997. 64. Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets L. Hemaspaandra and J. Rothe SIAM Journal on Computing V. 26 #3 pp. 634 653 June 1997. 65. Polynomial-Time Multi-Selectivity L. Hemaspaandra Z. Jiang J. Rothe and O. Watanabe Journal of Universal Computer Science V. 3 #3 pp. 197 229 March 1997. 66. Logspace Reducibility: Models and Equivalences L. Hemaspaandra and Z. Jiang International Journal of Foundations of Computer Science V. 8 #1 pp. 95 108 March 1997. 67. Threshold Computation and Cryptographic Security Y. Han L. Hemaspaandra and T. Thierauf SIAM Journal on Computing V. 26 #1 pp. 59 78 February 1997. 5

INFO HASH : e460993b110c3a04cafc777c31ed3928782807db

Download now

File Size: 220.2 kb