The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Peter Rossmanith: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
    Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:260-276 [Conf]
  2. Peter Rossmanith
    Learning from Random Text. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:132-144 [Conf]
  3. Javier Esparza, Peter Rossmanith
    An Automata Approach to Some Problems on Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:143-152 [Conf]
  4. Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon
    Efficient Algorithms for Model Checking Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:232-247 [Conf]
  5. Klaus-Jörn Lange, Peter Rossmanith
    Unambiguous Polynomial Hierarchies and Exponential Size. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:106-115 [Conf]
  6. Daniel Mölle, Stefan Richter, Peter Rossmanith
    Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:265-273 [Conf]
  7. Daniel Mölle, Stefan Richter, Peter Rossmanith
    Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:270-280 [Conf]
  8. Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith
    Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:305-313 [Conf]
  9. Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
    Unambiguity and Fewness for Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:168-179 [Conf]
  10. Rolf Niedermeier, Peter Rossmanith
    PRAM's Towards Realistic Parallelism: BRAM's. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:363-373 [Conf]
  11. Inga Niepel, Peter Rossmanith
    Uniform Circuits and Exclusive Read PRAMs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:307-318 [Conf]
  12. Rolf Niedermeier, Peter Rossmanith
    New Upper Bounds for MaxSat. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:575-584 [Conf]
  13. Peter Rossmanith, Thomas Zeugmann
    Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 1998, pp:13-24 [Conf]
  14. Jens Gramm, Rolf Niedermeier, Peter Rossmanith
    Exact Solutions for CLOSEST STRING and Related Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:441-453 [Conf]
  15. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    Intuitive Algorithms and t-Vertex Cover. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:598-607 [Conf]
  16. Rolf Niedermeier, Peter Rossmanith
    On the Power of Reading and Writing Simultaneously in Parallel Computation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:240-249 [Conf]
  17. Rolf Niedermeier, Peter Rossmanith
    On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:180-191 [Conf]
  18. Rolf Niedermeier, Peter Rossmanith
    Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:387-400 [Conf]
  19. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    On the Parameterized Complexity of Exact Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:568-579 [Conf]
  20. Klaus-Jörn Lange, Peter Rossmanith
    Characterizing Unambiguous Augmented Pushdown Automata by Circuits. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:399-406 [Conf]
  21. Klaus-Jörn Lange, Peter Rossmanith
    The Emptiness Problem for Intersections of Regular Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:346-354 [Conf]
  22. Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
    Parallel Recognition and Ranking of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:24-36 [Conf]
  23. Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
    Faster Sorting and Routing on Grids with Diagonals. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:225-236 [Conf]
  24. Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
    Optimal Average Case Sorting on Arrays. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:503-514 [Conf]
  25. Daniel Mölle, Stefan Richter, Peter Rossmanith
    A Faster Algorithm for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:561-570 [Conf]
  26. Rolf Niedermeier, Peter Rossmanith
    Extended Locally Definable Acceptance Types (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:473-483 [Conf]
  27. Rolf Niedermeier, Peter Rossmanith
    Upper Bounds for Vertex Cover Further Improved. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:561-570 [Conf]
  28. Peter Rossmanith
    The Owner Concept for PRAMs. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:172-183 [Conf]
  29. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    Algorithms Based on the Treewidth of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:385-396 [Conf]
  30. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    Divide-and-Color. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:58-67 [Conf]
  31. Jens Gramm, Rolf Niedermeier, Peter Rossmanith
    Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:1, pp:25-42 [Journal]
  32. Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith
    Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:4, pp:438-458 [Journal]
  33. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
    Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:139-155 [Journal]
  34. Javier Esparza, Peter Rossmanith, Stefan Schwoon
    A Uniform Framework for Problems on Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:72, n:, pp:169-177 [Journal]
  35. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
    New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:37, pp:- [Journal]
  36. Rolf Niedermeier, Peter Rossmanith
    Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:227-245 [Journal]
  37. Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper
    An efficient automata approach to some problems on context-free grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:221-227 [Journal]
  38. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    Parameterized power domination complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:4, pp:145-149 [Journal]
  39. Rolf Niedermeier, Peter Rossmanith
    A general method to speed up fixed-parameter-tractable algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:3-4, pp:125-129 [Journal]
  40. Peter Rossmanith, Wojciech Rytter
    Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:267-272 [Journal]
  41. Rolf Niedermeier, Peter Rossmanith
    New Upper Bounds for Maximum Satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:36, n:1, pp:63-88 [Journal]
  42. Rolf Niedermeier, Peter Rossmanith
    On efficient fixed-parameter algorithms for weighted vertex cover. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:2, pp:63-77 [Journal]
  43. Rolf Niedermeier, Peter Rossmanith
    An efficient fixed-parameter algorithm for 3-Hitting Set. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:89-102 [Journal]
  44. Peter Rossmanith, Thomas Zeugmann
    Stochastic Finite Learning of the Pattern Languages. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:44, n:1/2, pp:67-91 [Journal]
  45. Carsten Damm, Markus Holzer, Peter Rossmanith
    Expressing Uniformity via Oracles. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:4, pp:355-366 [Journal]
  46. Rolf Niedermeier, Peter Rossmanith
    On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:299-309 [Journal]
  47. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
    Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:1, pp:119-156 [Journal]
  48. Rolf Niedermeier, Peter Rossmanith
    Unambiguous Computations and Locally Definable Acceptance Types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:194, n:1-2, pp:137-161 [Journal]
  49. Joachim Kneis, Daniel Mölle, Peter Rossmanith
    Partial vs. Complete Domination: t-Dominating Set. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:367-376 [Conf]

  50. A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. [Citation Graph (, )][DBLP]


  51. Breaking Anonymity by Learning a Unique Minimum Hitting Set. [Citation Graph (, )][DBLP]


  52. Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. [Citation Graph (, )][DBLP]


  53. A Fine-grained Analysis of a Simple Independent Set Algorithm. [Citation Graph (, )][DBLP]


  54. A New Algorithm for Finding Trees with Many Leaves. [Citation Graph (, )][DBLP]


  55. New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. [Citation Graph (, )][DBLP]


  56. An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. [Citation Graph (, )][DBLP]


  57. On Digraph Width Measures in Parameterized Algorithmics. [Citation Graph (, )][DBLP]


  58. Improved Upper Bounds for Partial Vertex Cover. [Citation Graph (, )][DBLP]


  59. Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles [Citation Graph (, )][DBLP]


  60. Are there any good digraph width measures? [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.452secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002