| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Benny Godlin, Emilia Katz, Johann A. Makowsky |
Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas.  |
J. Log. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Elena V. Ravve |
BCNF via Attribute Splitting. |
Conceptual Modelling and Its Theoretical Foundations |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Averbouch, Tomer Kotek, Johann A. Makowsky, Elena V. Ravve |
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Tittmann, Ilya Averbouch, Johann A. Makowsky |
The enumeration of vertex induced subgraphs with respect to the number of components. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Model Theory in Computer Science: My Own Recurrent Themes. |
CSL |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Averbouch, Benny Godlin, Johann A. Makowsky |
An extension of the bivariate chromatic polynomial. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Holger Dell, Johann A. Makowsky |
Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Application of Logic to Integer Sequences: A Survey. |
WoLLIC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomer Kotek, Johann A. Makowsky |
Definability of Combinatorial Functions and Their Linear Recurrence Relations. |
Fields of Logic and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Damian Niwinski |
The Ackermann Award 2010. |
CSL |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Averbouch, Johann A. Makowsky, Peter Tittmann |
A Graph Polynomial Arising from Community Structure (Extended Abstract). |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Alexander A. Razborov |
The Ackermann Award 2009. |
CSL |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Connection Matrices for MSOL-Definable Structural Invariants. |
ICLA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Cohen, Michael Kaminski, Johann A. Makowsky |
Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning. |
Journal of Logic, Language and Information |
2008 |
DBLP DOI BibTeX RDF |
Herbrand models, Sorites, Rough Set Theory, Equality, Default Logic, Vagueness, Indistinguishability, Anaphora |
| 1 | Benny Godlin, Emilia Katz, Johann A. Makowsky |
Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Johann A. Makowsky |
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Graph polynomials, Combinatorial counting functions, Descriptive complexity |
| 1 | Eldar Fischer, Johann A. Makowsky, Elena V. Ravve |
Counting truth assignments of formulas of bounded tree-width or clique-width. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
From Hilbert's program to a logic tool box. |
Ann. Math. Artif. Intell. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 01-08, 01A67, 68-01, 68-03, 97-03, 97D20, 03B70 |
| 1 | Markus Bläser, Holger Dell, Johann A. Makowsky |
Complexity of the Bollobás-Riordan Polynomial. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Averbouch, Benny Godlin, Johann A. Makowsky |
A Most General Edge Elimination Polynomial. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Godlin, Tomer Kotek, Johann A. Makowsky |
Evaluations of Graph Polynomials. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
From Hilbert's Program to a Logic Toolbox. |
ISAIM |
2008 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Johann A. Makowsky |
Linear Recurrence Relations for Graph Polynomials. |
Pillars of Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Damian Niwinski |
The Ackermann Award 2008. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomer Kotek, Johann A. Makowsky, Boris Zilber |
On Counting Generalized Colorings. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. |
CiE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
From Hilbert's Program to a Logic Toolbox. |
LPAR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski |
The Ackermann Award 2007. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin |
Computing Graph Polynomials on Graphs of Bounded Clique-Width. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Samson Abramsky, Erich Grädel, Johann A. Makowsky |
The Ackermann Award 2006. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Erich Grädel, Janos Makowsky, Alexander A. Razborov |
The Ackermann Award 2005. |
CSL |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Cohen, Michael Kaminski, Johann A. Makowsky |
Indistinguishability by Default. |
We Will Show Them! |
2005 |
DBLP BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Clemens Lautemann: 1951-2005 An Obituary. |
CSL |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Johann A. Makowsky |
On spectra of sentences of monadic second order logic with counting. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Algorithmic uses of the Feferman-Vaught Theorem. |
Ann. Pure Appl. Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Julian Mariño |
Tree-width and the monadic quantifier hierarchy. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Julian Mariño |
The parametrized complexity of knot polynomials. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Glikson, Johann A. Makowsky |
NCE Graph Grammars and Clique-Width. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Johann A. Makowsky |
The Specker-Blatter Theorem Revisited. |
COCOON |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Baaz, Johann A. Makowsky (eds.) |
Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings |
CSL |
2003 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky |
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. |
Mathematical Structures in Computer Science |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. |
Theory Comput. Syst. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Udi Rotics |
On the Clique-Width of Graphs with Few P4's. |
Int. J. Found. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Johann A. Makowsky, Elena V. Ravve |
Dependency Preserving Refinements and the Fundamental Problem of Database Design. |
Data Knowl. Eng. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin |
Extensions for Open Default Theories via the Domain Closure Assumption. |
J. Log. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Y. B. Pnueli |
Erratum to ``Arity and Alternation in Second-Order Logic. |
Ann. Pure Appl. Logic |
1998 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Invariant Definability and P/poly. |
CSL |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan |
Restrictions of Minimum Spanner Problems. |
Inf. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický |
Finitary Sketches. |
J. Symb. Log. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Johann A. Makowsky, Elena V. Ravve |
The Fundamental Problem of Database Design. |
SOFSEM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Invariant Definability (Extended Abstract). |
Kurt Gödel Colloquium |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Y. B. Pnueli |
Arity and Alternation in Second-Order Logic. |
Ann. Pure Appl. Logic |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin |
Extensions for Open Default Theories via the Domain Closure Assumption. |
JELIA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Elena V. Ravve |
Translation Schemes and the Fundamental Problem of Database Design. |
ER |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Abraham Sharell |
On Average Case Complexity of SAT for Symmetric Distribution. |
J. Log. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Elena V. Ravve |
Incremental Model Checking for Decomposable Structures (Extended Abstract). |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Y. B. Pnueli |
Logics Capturing Relativized Complexity Classes Uniformly. |
LCC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Y. B. Pnueli |
Arity vs. Alternation in Second Order Logic. |
LFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Capturing Complexity Classes with Lindström Quantifiers. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Y. B. Pnueli |
Oracles and Quantifiers. |
CSL |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob P. Ukelson, Johann A. Makowsky |
Formal Interactive Menu Design. |
Interacting with Computers |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, J.-C. Gregoire, Shmuel Sagiv |
The Expressive Power of Side Effects in Prolog. |
J. Log. Program. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, Johann A. Makowsky |
Query Languages for Hierarchic Databases |
Inf. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Calò, Johann A. Makowsky |
The Ehrenfeucht-Fraisse Games for Transitive Closure. |
LFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael L. Tiomkin, Johann A. Makowsky |
Decidability of Finite Probablistic Propositional Dynamic Logics |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaniv Bargury, Johann A. Makowsky |
The Expressive Power of Transitive Closue and 2-way Multihead Automata. |
CSL |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor M. Markowitz, Johann A. Makowsky |
Identifying Extended Entity-Relationship Object Structures in Relational Schemas. |
IEEE Trans. Software Eng. |
1990 |
DBLP DOI BibTeX RDF |
extended entity-relationship object structures, relation-schemes, key dependencies, key-based inclusion dependencies, referential integrity constraints, EER schema, EER-convertible, EER object structures, normalization procedure, relational database schemas, object-oriented database schemas, semantics, object-oriented programming, relational databases, database management systems, database theory, normal form, relational schemas |
| 1 | Johann A. Makowsky, Ildikó Sain |
Weak Second Order Characterizations of Various Program Verification Systems. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor M. Markowitz, Johann A. Makowsky |
Incremental Restructuring of Relational Schemas. |
ICDE |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Itai, Johann A. Makowsky |
Unification as a Complexity Measure for Logic Programming. |
J. Log. Program. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples. |
J. Comput. Syst. Sci. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor M. Markowitz, Johann A. Makowsky |
Incremental Reorganization of Relational Databases. |
VLDB |
1987 |
DBLP BibTeX RDF |
|
| 1 | Johann A. Makowsky, Moshe Y. Vardi |
On the Expressive Power of Data Dependencies. |
Acta Inf. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, Johann A. Makowsky |
Computable Directory Queries. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Victor M. Markowitz, Nimrod Rotics |
Entity-Relationship Consistency for Relational Schemas. |
ICDT |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Ildikó Sain |
On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems |
LICS |
1986 |
DBLP BibTeX RDF |
|
| 1 | Elias Dahlhaus, Johann A. Makowsky |
The Choice of Programming Primitives for SETL-Like Programming Languages. |
ESOP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael L. Tiomkin, Johann A. Makowsky |
Propositional Dynamic Logic with Local Assignments. |
Theor. Comput. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Grumberg, Nissim Francez, Johann A. Makowsky, Willem P. de Roever |
A Proof Rule for Fair Termination of Guarded Commands |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Vopenka's Principle and Compact Logics. |
J. Symb. Log. |
1985 |
DBLP BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract). |
TAPSOFT, Vol.1 |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Mahr, Johann A. Makowsky |
Characterizing Specification Languages which Admit Initial Semantics. |
Theor. Comput. Sci. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky, Bernd Mahr |
An axiomatic approach to semantics of specification languages. |
Theoretical Computer Science |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Mahr, Johann A. Makowsky |
Characterizing Specification Languages Which Admit Initial Semantics. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Characterizing Data Base Dependencies. |
ICALP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. |
ICALP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky |
Embedded Implicational Dependencies and their Inference Problem |
STOC |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. |
ICALP |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky |
Embedded Implicational Dependencies and their Inference Problem. |
XP1 Workshop on Database Theory |
1980 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")