The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Johann A. Makowsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Victor M. Markowitz, Johann A. Makowsky
    Identifying Extended Entity-Relationship Object Structures in Relational Schemas. [Citation Graph (23, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:8, pp:777-790 [Journal]
  2. Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
    Embedded Implicational Dependencies and their Inference Problem [Citation Graph (13, 0)][DBLP]
    STOC, 1981, pp:342-354 [Conf]
  3. Johann A. Makowsky, Victor M. Markowitz, Nimrod Rotics
    Entity-Relationship Consistency for Relational Schemas. [Citation Graph (8, 10)][DBLP]
    ICDT, 1986, pp:306-322 [Conf]
  4. Johann A. Makowsky
    Characterizing Data Base Dependencies. [Citation Graph (4, 0)][DBLP]
    ICALP, 1981, pp:86-97 [Conf]
  5. Elias Dahlhaus, Johann A. Makowsky
    Computable Directory Queries. [Citation Graph (3, 0)][DBLP]
    CAAP, 1986, pp:254-265 [Conf]
  6. Victor M. Markowitz, Johann A. Makowsky
    Incremental Reorganization of Relational Databases. [Citation Graph (3, 12)][DBLP]
    VLDB, 1987, pp:127-135 [Conf]
  7. Elias Dahlhaus, Johann A. Makowsky
    The Choice of Programming Primitives for SETL-Like Programming Languages. [Citation Graph (1, 0)][DBLP]
    ESOP, 1986, pp:160-172 [Conf]
  8. Johann A. Makowsky
    Capturing Complexity Classes with Lindström Quantifiers. [Citation Graph (1, 0)][DBLP]
    MFCS, 1994, pp:68-71 [Conf]
  9. Johann A. Makowsky
    Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:374-387 [Conf]
  10. Johann A. Makowsky, Moshe Y. Vardi
    On the Expressive Power of Data Dependencies. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1986, v:23, n:3, pp:231-244 [Journal]
  11. Johann A. Makowsky, Y. B. Pnueli
    Arity and Alternation in Second-Order Logic. [Citation Graph (1, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:189-202 [Journal]
  12. Ariel Cohen, Michael Kaminski, Johann A. Makowsky
    Indistinguishability by Default. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:415-428 [Conf]
  13. Bernd Mahr, Johann A. Makowsky
    Characterizing Specification Languages Which Admit Initial Semantics. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:300-316 [Conf]
  14. Johann A. Makowsky
    From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:330-341 [Conf]
  15. Eldar Fischer, Johann A. Makowsky
    The Specker-Blatter Theorem Revisited. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:90-101 [Conf]
  16. Samson Abramsky, Erich Grädel, Johann A. Makowsky
    The Ackermann Award 2006. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:622-626 [Conf]
  17. Yaniv Bargury, Johann A. Makowsky
    The Expressive Power of Transitive Closue and 2-way Multihead Automata. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:1-14 [Conf]
  18. Johann A. Makowsky
    Clemens Lautemann: 1951-2005 An Obituary. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:566-566 [Conf]
  19. Johann A. Makowsky
    Invariant Definability and P/poly. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:142-158 [Conf]
  20. Johann A. Makowsky, Klaus Meer
    On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:399-410 [Conf]
  21. Johann A. Makowsky, Y. B. Pnueli
    Oracles and Quantifiers. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:189-222 [Conf]
  22. Johann A. Makowsky, Elena V. Ravve
    Translation Schemes and the Fundamental Problem of Database Design. [Citation Graph (0, 11)][DBLP]
    ER, 1996, pp:5-26 [Conf]
  23. Johann A. Makowsky
    Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:409-421 [Conf]
  24. Johann A. Makowsky
    Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:551- [Conf]
  25. Victor M. Markowitz, Johann A. Makowsky
    Incremental Restructuring of Relational Schemas. [Citation Graph (0, 11)][DBLP]
    ICDE, 1988, pp:276-284 [Conf]
  26. Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin
    Extensions for Open Default Theories via the Domain Closure Assumption. [Citation Graph (0, 0)][DBLP]
    JELIA, 1996, pp:373-387 [Conf]
  27. Johann A. Makowsky
    Invariant Definability (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:186-202 [Conf]
  28. Johann A. Makowsky, Y. B. Pnueli
    Logics Capturing Relativized Complexity Classes Uniformly. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:463-479 [Conf]
  29. A. Calò, Johann A. Makowsky
    The Ehrenfeucht-Fraisse Games for Transitive Closure. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:57-68 [Conf]
  30. Johann A. Makowsky, Y. B. Pnueli
    Arity vs. Alternation in Second Order Logic. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:240-252 [Conf]
  31. Johann A. Makowsky, Ildikó Sain
    On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:293-300 [Conf]
  32. Johann A. Makowsky, Elena V. Ravve
    Incremental Model Checking for Decomposable Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:540-551 [Conf]
  33. Johann A. Makowsky
    Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:487-495 [Conf]
  34. Johann A. Makowsky, Elena V. Ravve
    The Fundamental Problem of Database Design. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:53-69 [Conf]
  35. Johann A. Makowsky, Bernd Mahr
    An axiomatic approach to semantics of specification languages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:211-219 [Conf]
  36. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:1-16 [Conf]
  37. Alexander Glikson, Johann A. Makowsky
    NCE Graph Grammars and Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:237-248 [Conf]
  38. Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin
    Computing Graph Polynomials on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:191-204 [Conf]
  39. Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
    Embedded Implicational Dependencies and their Inference Problem. [Citation Graph (0, 0)][DBLP]
    XP1 Workshop on Database Theory, 1980, pp:- [Conf]
  40. Johann A. Makowsky
    Algorithmic uses of the Feferman-Vaught Theorem. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:159-213 [Journal]
  41. Johann A. Makowsky, Y. B. Pnueli
    Erratum to ``Arity and Alternation in Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:92, n:2, pp:215- [Journal]
  42. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:23-52 [Journal]
  43. Johann A. Makowsky
    Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:276-290 [Journal]
  44. Johann A. Makowsky, Elena V. Ravve
    Dependency Preserving Refinements and the Fundamental Problem of Database Design. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 1998, v:24, n:3, pp:277-312 [Journal]
  45. Elias Dahlhaus, Johann A. Makowsky
    Query Languages for Hierarchic Databases [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:1, pp:1-32 [Journal]
  46. Orna Grumberg, Nissim Francez, Johann A. Makowsky, Willem P. de Roever
    A Proof Rule for Fair Termination of Guarded Commands [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:83-102 [Journal]
  47. Michael L. Tiomkin, Johann A. Makowsky
    Decidability of Finite Probablistic Propositional Dynamic Logics [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:94, n:2, pp:180-203 [Journal]
  48. G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan
    Restrictions of Minimum Spanner Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:136, n:2, pp:143-164 [Journal]
  49. Johann A. Makowsky, Udi Rotics
    On the Clique-Width of Graphs with Few P4's. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:329-348 [Journal]
  50. Jacob P. Ukelson, Johann A. Makowsky
    Formal Interactive Menu Design. [Citation Graph (0, 0)][DBLP]
    Interacting with Computers, 1992, v:4, n:1, pp:83-101 [Journal]
  51. Johann A. Makowsky
    Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:34, n:2/3, pp:266-292 [Journal]
  52. Johann A. Makowsky, Julian Mariño
    The parametrized complexity of knot polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:742-756 [Journal]
  53. Alon Itai, Johann A. Makowsky
    Unification as a Complexity Measure for Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1987, v:4, n:2, pp:105-117 [Journal]
  54. Johann A. Makowsky, J.-C. Gregoire, Shmuel Sagiv
    The Expressive Power of Side Effects in Prolog. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:12, n:1&2, pp:179-188 [Journal]
  55. Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický
    Finitary Sketches. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:3, pp:699-707 [Journal]
  56. Johann A. Makowsky
    Vopenka's Principle and Compact Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:1, pp:42-48 [Journal]
  57. Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin
    Extensions for Open Default Theories via the Domain Closure Assumption. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1998, v:8, n:2, pp:169-187 [Journal]
  58. Johann A. Makowsky, Abraham Sharell
    On Average Case Complexity of SAT for Symmetric Distribution. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:1, pp:71-92 [Journal]
  59. Bruno Courcelle, Johann A. Makowsky
    Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2002, v:12, n:2, pp:203-235 [Journal]
  60. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:125-150 [Journal]
  61. Bernd Mahr, Johann A. Makowsky
    Characterizing Specification Languages which Admit Initial Semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:31, n:, pp:49-59 [Journal]
  62. Johann A. Makowsky, Julian Mariño
    Tree-width and the monadic quantifier hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:157-170 [Journal]
  63. Johann A. Makowsky, Ildikó Sain
    Weak Second Order Characterizations of Various Program Verification Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:3, pp:299-321 [Journal]
  64. Michael L. Tiomkin, Johann A. Makowsky
    Propositional Dynamic Logic with Local Assignments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:71-87 [Journal]
  65. Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski
    The Ackermann Award 2007. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:589-597 [Conf]
  66. Johann A. Makowsky
    From Hilbert's Program to a Logic Toolbox. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:1- [Conf]

  67. Linear Recurrence Relations for Graph Polynomials. [Citation Graph (, )][DBLP]


  68. Definability of Combinatorial Functions and Their Linear Recurrence Relations. [Citation Graph (, )][DBLP]


  69. Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. [Citation Graph (, )][DBLP]


  70. On Counting Generalized Colorings. [Citation Graph (, )][DBLP]


  71. The Ackermann Award 2008. [Citation Graph (, )][DBLP]


  72. The Ackermann Award 2010. [Citation Graph (, )][DBLP]


  73. The Ackermann Award 2009. [Citation Graph (, )][DBLP]


  74. Complexity of the Bollobás-Riordan Polynomial. [Citation Graph (, )][DBLP]


  75. Evaluations of Graph Polynomials. [Citation Graph (, )][DBLP]


  76. A Graph Polynomial Arising from Community Structure (Extended Abstract). [Citation Graph (, )][DBLP]


  77. A Most General Edge Elimination Polynomial. [Citation Graph (, )][DBLP]


  78. Application of Logic to Integer Sequences: A Survey. [Citation Graph (, )][DBLP]


  79. Connection Matrices for MSOL-Definable Structural Invariants. [Citation Graph (, )][DBLP]


  80. From Hilbert's program to a logic tool box. [Citation Graph (, )][DBLP]


  81. Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas [Citation Graph (, )][DBLP]


  82. Counting truth assignments of formulas of bounded tree-width or clique-width. [Citation Graph (, )][DBLP]


  83. An extension of the bivariate chromatic polynomial. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002