Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Lane A. Hemaspaandra Lane A. Hemachandra ( http://dblp.L3S.de/Authors/Lane_A._Hemaspaandra )

Publication years (Num. hits)
1986-1989 (19) 1990-1991 (21) 1992-1993 (22) 1994-1995 (17) 1996-1997 (25) 1998 (15) 1999 (29) 2000-2001 (21) 2002-2003 (15) 2004-2005 (30) 2006 (16) 2007-2008 (23) 2009-2010 (21) 2011-2012 (14)
Publication types (Num. hits)
article(211) inproceedings(77)
Venues (Conferences, Journals, ...)
CoRR(62) SIGACT News(51) Theor. Comput. Sci.(23) SIAM J. Comput.(14) MFCS(12) Inf. Comput.(10) J. Comput. Syst. Sci.(8) FCT(7) ICALP(7) STACS(7) Structure in Complexity Theory...(7) Int. J. Found. Comput. Sci.(6) COCOON(5) Inf. Process. Lett.(5) AAAI(4) J. UCS(4) More (+10 of total 53)
Authors
Lane A. Hemaspaandra(228) Edith Hemaspaandra(67) Lane A. Hemachandra(60) Jörg Rothe(58) Harald Hempel(31) Piotr Faliszewski(27) Gerd Wechsung(18) Mitsunori Ogihara(15) Jin-yi Cai(14) Albrecht Hoene(12) Osamu Watanabe(11) Christopher M. Homan(10) Mitsunori Ogiwara(9) Juris Hartmanis(8) Alan L. Selman(7) Marius Zimand(7) More (+10 of total 91)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 10 keywords
Results
Found 288 publication records. Showing 288 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Online Voter Control in Sequential Elections Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton Search versus Decision for Election Manipulation Problems Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Controlling Candidate-Sequential Elections Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe The Complexity of Online Manipulation of Sequential Elections Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 73. Search on Bibsonomy SIGACT News The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Kyle Murray, Xiaoqing Tang Barbosa, Uniform Polynomial Time Bounds, and Promises Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra Multimode Control Attacks on Elections. Search on Bibsonomy J. Artif. Intell. Res. (JAIR) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 71. Search on Bibsonomy SIGACT News The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 72. Search on Bibsonomy SIGACT News The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 69. Search on Bibsonomy SIGACT News The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 70. Search on Bibsonomy SIGACT News The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra The complexity of manipulative attacks in nearly single-peaked electorates. Search on Bibsonomy TARK The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe On the complexity of kings. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra Using complexity to protect elections. Search on Bibsonomy Commun. ACM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra Multimode Control Attacks on Elections Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra A Note on Nonuniform versus Uniform ACC^k Circuits for NE Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT News Complexity Theory Column 67. Search on Bibsonomy SIGACT News The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 68. Search on Bibsonomy SIGACT News The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. Search on Bibsonomy AAAI The full citation details ... 2010 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Search on Bibsonomy Math. Log. Q. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski Frequency of correctness versus average polynomial time. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski Generalized juntas and NP-hard sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra The complexity of power-index comparison. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christopher M. Homan, Lane A. Hemaspaandra Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Search on Bibsonomy J. Heuristics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. Search on Bibsonomy J. Artif. Intell. Res. (JAIR) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra How Hard Is Bribery in Elections? Search on Bibsonomy J. Artif. Intell. Res. (JAIR) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 64. Search on Bibsonomy SIGACT News The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 65. Search on Bibsonomy SIGACT News The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 63. Search on Bibsonomy SIGACT News The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 62. Search on Bibsonomy SIGACT News The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra Multimode Control Attacks on Elections. Search on Bibsonomy IJCAI The full citation details ... 2009 DBLP  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe The shield that never was: societies with single-peaked preferences are more open to manipulation and control. Search on Bibsonomy TARK The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra The consequences of eliminating NP solutions. Search on Bibsonomy Computer Science Review The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Llull and Copeland Voting Computationally Resist Bribery and Control Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra The Complexity of Power-Index Comparison Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 61. Search on Bibsonomy SIGACT News The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 59: introduction. Search on Bibsonomy SIGACT News The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Copeland Voting Fully Resists Constructive Control. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Computational social choice theory, multiagent systems, preference aggregation
1Piotr Faliszewski, Lane A. Hemaspaandra The Complexity of Power-Index Comparison. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF power indices, computational complexity, Weighted voting games
1Lane A. Hemaspaandra, Mayur Thakur Query-monotonic Turing reductions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub Cluster computing and the power of edge recognition. Search on Bibsonomy Inf. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Copeland Voting Fully Resists Constructive Control Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Anyone but him: The complexity of precluding an alternative. Search on Bibsonomy Artif. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra Introduction. Search on Bibsonomy SIGACT News The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra Introduction. Search on Bibsonomy SIGACT News The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi Complexity results in graph reconstruction. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra Dichotomy for voting systems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner The Complexity of Computing the Size of an Interval. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Search on Bibsonomy IJCAI The full citation details ... 2007 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe On the Complexity of Kings. Search on Bibsonomy FCT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. Search on Bibsonomy FCT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Llull and Copeland Voting Broadly Resist Bribery and Control. Search on Bibsonomy AAAI The full citation details ... 2007 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe If P neq NP then some strongly noninvertible functions are invertible. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra How Hard Is Bribery in Elections? Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra The Consequences of Eliminating NP Solutions Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Hybrid Elections Broaden Complexity-Theoretic Resistance to Control Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Mayur Thakur Query-Monotonic Turing Reductions Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe A Richer Understanding of the Complexity of Election Systems Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand The Complexity of Finding Top-Toda-Equivalence-Class Members. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 52. Search on Bibsonomy SIGACT News The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 51. Search on Bibsonomy SIGACT News The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 53. Search on Bibsonomy SIGACT News The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra Open questions in the theory of semifeasible computation. Search on Bibsonomy SIGACT News The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub Cluster Computing and the Power of Edge Recognition. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christopher M. Homan, Lane A. Hemaspaandra Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra The Consequences of Eliminating NP Solutions. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Leen Torenvliet P-Selectivity, Immunity, and the Power of One Bit. Search on Bibsonomy SOFSEM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra The Complexity of Bribery in Elections. Search on Bibsonomy AAAI The full citation details ... 2006 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel All superlinear inverse schemes are coNP-hard. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau Context-free languages can be accepted with absolutely no space overhead. Search on Bibsonomy Inf. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara Competing provers yield improved Karp-Lipton collapse results. Search on Bibsonomy Inf. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub Cluster Computing and the Power of Edge Recognition Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Anyone but Him: The Complexity of Precluding an Alternative Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe The Complexity of Kings Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra Open Questions in the Theory of Semifeasible Computation Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Christopher M. Homan, Lane A. Hemaspaandra Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner The Complexity of Computing the Size of an Interval Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra Dichotomy for Voting Systems Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen Algebraic Properties for Selector Functions Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Leen Torenvliet P-Selectivity, Immunity, and the Power of One Bit Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 49. Search on Bibsonomy SIGACT News The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 48. Search on Bibsonomy SIGACT News The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. Search on Bibsonomy ICTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Mayur Thakur Query-Monotonic Turing Reductions. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe Anyone but Him: The Complexity of Precluding an Alternative. Search on Bibsonomy AAAI The full citation details ... 2005 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Mayur Thakur Lower bounds and the hardness of counting properties. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau Overhead-Free Computation, DCFLs, and CFLs Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel All Superlinear Inverse Schemes are coNP-Hard Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi Complexity Results in Graph Reconstruction Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra SIGACT news complexity theory column 43. Search on Bibsonomy SIGACT News The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen Algebraic Properties for Selector Functions. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 288 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.