The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Rod Downey Rodney G. Downey ( http://dblp.L3S.de/Authors/Rod_Downey )

URL (Homepage):  http://www.mcs.vuw.ac.nz/people/Rod-Downey  Author page on DBLP  Author page in RDF  Community of Rod Downey in ASPL-2

Publication years (Num. hits)
1984-1990 (16) 1991-1993 (17) 1994-1997 (20) 1998-2001 (19) 2002-2004 (23) 2005-2006 (16) 2007-2009 (20) 2010-2012 (11)
Publication types (Num. hits)
article(111) inproceedings(28) proceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 142 publication records. Showing 142 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Rod Downey A Parameterized Complexity Tutorial. Search on Bibsonomy LATA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paul Brodhead, Rod Downey, Keng Meng Ng Bounded Randomness. Search on Bibsonomy Computation, Physics and Beyond The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Barbara F. Csima, Rod Downey, Keng Meng Ng Limits on jump inversion for strong reducibilities. Search on Bibsonomy J. Symb. Log. The full citation details ... 2011 DBLP  BibTeX  RDF
1George Barmpalias, Rod Downey, Keng Meng Ng Jump inversions inside effectively closed sets and applications to randomness. Search on Bibsonomy J. Symb. Log. The full citation details ... 2011 DBLP  BibTeX  RDF
1Rodney G. Downey, Dimitrios M. Thilikos Confronting intractability via parameters. Search on Bibsonomy Computer Science Review The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Asher M. Kach Euclidean Functions of Computable Euclidean Domains. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2011 DBLP  BibTeX  RDF
1Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans Binary subtrees with few labeled paths. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Dimitrios M. Thilikos Confronting Intractability via Parameters Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Rod Downey, Keng Meng Ng Effective Packing Dimension and Traceability. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2010 DBLP  BibTeX  RDF
1Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky Decidability and Computability of Certain Torsion-Free Abelian Groups. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2010 DBLP  BibTeX  RDF
1Laurent Bienvenu, Rod Downey Kolmogorov Complexity and Solovay Functions Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Laurent Bienvenu, Rod Downey Kolmogorov Complexity and Solovay Functions. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rod Downey, Keng Meng Ng Lowness for Demuth Randomness. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Bart Kastermans, Steffen Lempp On computable self-embeddings of computable linear orderings. Search on Bibsonomy J. Symb. Log. The full citation details ... 2009 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin On problems without polynomial kernels. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin Space complexity of Abelian groups. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rod Downey, Noam Greenberg Turing degrees of reals of positive effective packing dimension. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rod Downey, Noam Greenberg, Joseph S. Miller The upward closure of a perfect thin class. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi (eds.) Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007 Search on Bibsonomy Algorithmic-Logical Theory of Infinite Structures The full citation details ... 2008 DBLP  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond Parameterized approximation of dominating set problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Peter Cholak, Rodney G. Downey, Leo Harrington The Complexity of Orbits of Computably Enumerable Sets. Search on Bibsonomy Bulletin of Symbolic Logic The full citation details ... 2008 DBLP  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Michael A. Langston The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. Search on Bibsonomy Comput. J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin On Problems without Polynomial Kernels (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer Bounded fixed-parameter tractability and reducibility. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Rod Downey Foreword. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Search on Bibsonomy Algorithmic-Logical Theory of Infinite Structures The full citation details ... 2007 DBLP  BibTeX  RDF
1Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Search on Bibsonomy Algorithmic-Logical Theory of Infinite Structures The full citation details ... 2007 DBLP  BibTeX  RDF
1Rodney G. Downey, Catherine McCartin Online promise problems with online width metrics. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte Undecidability of the structure of the Solovay degrees of c.e. reals. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Jan Reimann Algorithmic randomness. Search on Bibsonomy Scholarpedia The full citation details ... 2007 DBLP  BibTeX  RDF
1Rod Downey, Michael A. Langston, Rolf Niedermeier Editorial. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller Every 1-generic computes a properly 1-generic. Search on Bibsonomy J. Symb. Log. The full citation details ... 2006 DBLP  BibTeX  RDF
1Rod Downey, André Nies, Rebecca Weber, Liang Yu Lowness and Pi20 nullsets. Search on Bibsonomy J. Symb. Log. The full citation details ... 2006 DBLP  BibTeX  RDF
1Rod Downey, Liang Yu Arithmetical Sacks Forcing. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (1991) Primary 03D28, Secondary 03D65
1Rod Downey, Noam Greenberg Totally < ωω Computably Enumerable and m-topped Degrees. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Wolfgang Merkle, Jan Reimann Schnorr dimension. Search on Bibsonomy Mathematical Structures in Computer Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn Calibrating Randomness. Search on Bibsonomy Bulletin of Symbolic Logic The full citation details ... 2006 DBLP  BibTeX  RDF
1Rodney G. Downey, Robert Goldblatt Foreword. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller On self-embeddings of computable linear orderings. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Catherine McCartin Parameterized Approximation Problems. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger (eds.) Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 Search on Bibsonomy Exact Algorithms and Fixed-Parameter Tractability The full citation details ... 2006 DBLP  BibTeX  RDF
1Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte Completing pseudojump operators. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger 05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Search on Bibsonomy Exact Algorithms and Fixed-Parameter Tractability The full citation details ... 2005 DBLP  BibTeX  RDF
1Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger 05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Search on Bibsonomy Exact Algorithms and Fixed-Parameter Tractability The full citation details ... 2005 DBLP  BibTeX  RDF
1Rodney G. Downey, Catherine McCartin Bounded Persistence Pathwidth. Search on Bibsonomy CATS The full citation details ... 2005 DBLP  BibTeX  RDF
1Rodney G. Downey, Wolfgang Merkle, Jan Reimann Schnorr Dimension. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rod Downey, Evan J. Griffiths, Geoffrey LaForte On Schnorr and computable randomness, martingales, and machines. Search on Bibsonomy Math. Log. Q. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rod Downey, Guohua Wu, Xizhong Zheng Degrees of d. c. e. reals. Search on Bibsonomy Math. Log. Q. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rod Downey, Liang Yu There Are No Maximal Low D.C.E. Degrees. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2004 DBLP  BibTeX  RDF
1Rod Downey, Angsheng Li, Guohua Wu Complementing cappable degrees in the difference hierarchy. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Evan J. Griffiths, Stephanie Reid On Kurtz randomness. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Evan J. Griffiths Schnorr randomness. Search on Bibsonomy J. Symb. Log. The full citation details ... 2004 DBLP  BibTeX  RDF
1Liang Yu, Decheng Ding, Rodney G. Downey The Kolmogorov complexity of random reals. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte Randomness and reducibility. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey Some Recent Progress in Algorithmic Randomness. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Catherine McCartin Online Problems, Pathwidth, and Persistence. Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne (eds.) Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  BibTeX  RDF
1Rodney G. Downey, Catherine McCartin Some New Directions and Questions in Parameterized Complexity. Search on Bibsonomy Developments in Language Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Lance Fortnow Uniformly hard languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Geoffrey LaForte, Richard A. Shore Decomposition and infima in the computably enumerable degrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 2003 DBLP  BibTeX  RDF
1Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Sebastiaan Terwijn Computably Enumerable Reals and Uniformly Presentable Ideals. Search on Bibsonomy Math. Log. Q. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Geoffrey LaForte Presentations of computably enumerable reals. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey Roman Murawski, Recursive Functions and Metamathematics. Search on Bibsonomy Studia Logica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Steffen Lempp Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. Search on Bibsonomy J. Symb. Log. The full citation details ... 2002 DBLP  BibTeX  RDF
1Peter Cholak, Rodney G. Downey, Stephen Walk Maximal Contiguous Degrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 2002 DBLP  BibTeX  RDF
1Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan Trivial Reals. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Evan J. Griffiths Schnorr Randomness. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Denis R. Hirschfeldt, André Nies Randomness, Computability, and Density. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Amy Gale, Rodney G. Downey On Genericity and Ershov's Hierarchy. Search on Bibsonomy Math. Log. Q. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon A delta02 Set with No Infinite Low Subset in Either It or Its Complement. Search on Bibsonomy J. Symb. Log. The full citation details ... 2001 DBLP  BibTeX  RDF
1Peter Cholak, Rodney G. Downey, Eberhard Herrmann Some orbits for E. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2001 DBLP  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows Index sets and parametric reductions. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Index set, Parameterized complexity
1Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte Randomness and Reducibility. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Denis R. Hirschfeldt, André Nies Randomness, Computability, and Density. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston On computing graph minor obstruction sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Venkatesh Raman The complexity of irredundant sets parameterized by size. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, André Nies Undecidability Results for Low Complexity Time Classes. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Geoffrey LaForte, Steffen Lempp A Delta02 Set With Barely Sigma02 Degree. Search on Bibsonomy J. Symb. Log. The full citation details ... 1999 DBLP  BibTeX  RDF
1Rodney G. Downey, Carl G. Jockusch Jr. Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1. Search on Bibsonomy J. Symb. Log. The full citation details ... 1999 DBLP  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Ulrike Stege Computational Tractability: The View From Mars. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1999 DBLP  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle The Parametrized Complexity of Some Fundamental Problems in Coding Theory. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows Threshold Dominating Sets and an Improved Characterization of W[2]. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan Parameterized Circuit Complexity and the W Hierarchy. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Richard A. Shore Splitting Theorems and the Jump Operator. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Geoffrey LaForte, André Nies Computably Enumerable Sets and Quasi-Reducibility. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel Difference Sets and Computability Theory. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Lance Fortnow Uniformly Hard Languages. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey On the Universal Splitting Property. Search on Bibsonomy Math. Log. Q. The full citation details ... 1997 DBLP  BibTeX  RDF
1Rich Blaylock, Rodney G. Downey, Steffen Lempp Infima in the Recursively Enumerable Weak Truth Table Degrees. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 1997 DBLP  BibTeX  RDF
1Rodney G. Downey, Steffen Lempp Contiguity and Distributivity in the Enumerable Turing Degrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 1997 DBLP  BibTeX  RDF
1Bruno Courcelle, Rodney G. Downey, Michael R. Fellows A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. Search on Bibsonomy J. UCS The full citation details ... 1997 DBLP  BibTeX  RDF
1Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows Advice Classes of Parameterized Tractability. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows On the parameterized complexity of short computation and factorization. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, André Nies Undecidability Results for Low Complexity Degree Structures. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF undecidability results, low complexity degree structures, EXPTIME degrees, polynomial time Turing, many-one reducibility, coding method, ideal lattices, hyper-polynomial time classes, Boolean algebra, Boolean algebras
1Rodney G. Downey, Leo Harrington There is No Fat Orbit. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham The Parameterized Complexity of Sequence Alignment and Consensus. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Michael R. Fellows Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows On the Structure of Parameterized Problems in NP. Search on Bibsonomy Inf. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 142 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.