Bakhadyr Khoussainov

Int. J. Grid Util. Comput., 2013

A Game Theoretic Approach to Service Discovery and Selection.

[BibT_eX]

[DOI]

Yi Chen

Proceedings of the IEEE International Conference on Systems, 2013

A Game Theory-Based Approach to Service Rating.

[BibT_eX]

[DOI]

Jupeng Zheng

Proceedings of the International Conference on Parallel and Distributed Computing, 2013

Dynamising Interval Scheduling: The Monotonic Case.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

On Decidable and Computable Models of Theories.

[BibT_eX]

[DOI]

Alexander Gavruskin

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

A Robust Service Recommendation Scheme.

[BibT_eX]

[DOI]

Jupeng Zheng

Proceedings of the 2013 IEEE International Conference on Services Computing, Santa Clara, CA, USA, June 28, 2013

2012

Computable Isomorphisms of Boolean Algebras with Operators.

[BibT_eX]

[DOI]

Tomasz Kowalski

Stud Logica, 2012

Finite Automata over Structures - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

On State Complexity of Finite Word and Tree Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Solving infinite games on trees with back-edges.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

Lectures on Discrete Mathematics for Computer Science

[BibT_eX]

[DOI]

Nodira Khoussainova

Algebra and Discrete Mathematics 3, World Scientific, ISBN: 978-981-4340-50-2, 2012

2011

Efficient Algorithms for Games Played on Trees with Back-edges.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

From automatic structures to automatic groups

[BibT_eX]

[DOI]

Olga Kharlampovich

Alexei Miasnikov

CoRR, 2011

Automatic Structures and Groups.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Extracting Winning Strategies in Update Games.

[BibT_eX]

[DOI]

Imran Khaliq

Proceedings of the Models of Computation in Context, 2011

Descriptional Complexity of Determinization and Complementation for Finite Automata.

[BibT_eX]

[DOI]

Nan Rosemary Ke

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

A computable Alef0-categorical structure whose theory computes true arithmetic.

[BibT_eX]

[DOI]

Antonio Montalbán

J. Symb. Log., 2010

On Index Sets of Some Properties of Computable Algebras.

[BibT_eX]

[DOI]

Andrei S. Morozov

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Unary automatic graphs: an algorithmic perspective.

[BibT_eX]

[DOI]

Mia Minnes

Math. Struct. Comput. Sci., 2009

Model-theoretic complexity of automatic structures.

[BibT_eX]

[DOI]

Mia Minnes

Ann. Pure Appl. Log., 2009

On complexity of Ehrenfeucht-Fraïssé games.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

Linear orders with distinguished function symbol.

[BibT_eX]

[DOI]

Douglas A. Cenzer

Barbara F. Csima

Arch. Math. Log., 2009

A Dynamic Algorithm for Reachability Games Played on Trees.

[BibT_eX]

[DOI]

Imran Khaliq

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Open Questions in the Theory of Automatic Structures.

[BibT_eX]

Bull. EATCS, 2008

Computable categoricity and the Ershov hierarchy.

[BibT_eX]

[DOI]

Yue Yang

Ann. Pure Appl. Log., 2008

Model Theoretic Complexity of Automatic Structures (Extended Abstract).

[BibT_eX]

[DOI]

Mia Minnes

Proceedings of the Theory and Applications of Models of Computation, 2008

From Automatic Structures to Borel Structures.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

When Is Reachability Intrinsically Decidable?.

[BibT_eX]

[DOI]

Barbara F. Csima

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Computable Categoricity of Graphs with Finite Components.

[BibT_eX]

[DOI]

Barbara F. Csima

Proceedings of the Logic and Theory of Algorithms, 2008

Sequential Automatic Algebras.

[BibT_eX]

[DOI]

Michael Brough

Peter Nelson

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Automatic Structures: Richness and Limitations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

Applications of Kolmogorov complexity to computable model theory.

[BibT_eX]

[DOI]

Pavel Semukhin

J. Symb. Log., 2007

07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

2006

An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.

[BibT_eX]

[DOI]

Denis R. Hirschfeldt

Pavel Semukhin

Notre Dame J. Formal Log., 2006

P01-Presentations of Algebras.

[BibT_eX]

[DOI]

Theodore A. Slaman

Pavel Semukhin

Arch. Math. Log., 2006

2005

Automatic linear orders and trees.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2005

Computably Enumerable Algebras, Their Expansions, and Isomorphisms.

[BibT_eX]

[DOI]

Steffen Lempp

Theodore A. Slaman

Int. J. Algebra Comput., 2005

Adaptive Verification using Forced Simulation.

[BibT_eX]

[DOI]

Roopak Sinha

Partha S. Roop

Proceedings of the Second International Workshop on Formal Foundations of Embedded Software and Component-based Software Architectures, 2005

Decidability of Term Algebras Extending Partial Algebras.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004

Definability and Regularity in Automatic Structures.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

2003

On algebraic and logical specifications of classes of regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A computably categorical structure whose expansion by a constant has infinite computable dimension.

[BibT_eX]

[DOI]

Denis R. Hirschfeldt

J. Symb. Log., 2003

Update games and update networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

Automatic Structures: Overview and Future Directions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

On Automatic Partial Orders.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Finite State Strategies in One Player McNaughton Games.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

On Algebraic Specifications of Abstract Data Types.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Relaxed Update and Partition Network Games.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Fundam. Informaticae, 2002

Degree spectra and computable dimensions in algebraic structures.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2002

Complexity of Some Infinite Games Played on Finite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Some Results on Automatic Structures.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001

Recursively enumerable reals and Chaitin Omega numbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Graphs with Automatic Presentations over a Unary Alphabet.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

On Game-Theoretic Models of Networks.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Algebraic constraints, automata, and regular languages.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposium, 2000

Finite nondeterministic automata: Simulation and minimality.

[BibT_eX]

[DOI]

Cristian Calude

Elena Calude

Theor. Comput. Sci., 2000

On Computability Theoretic Properties of Structures and Their Cartesian Products.

[BibT_eX]

[DOI]

Math. Log. Q., 2000

Update Networks and Their Routing Strategies.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999

Computably Categorical Structures and Expansions by Constants.

[BibT_eX]

[DOI]

J. Symb. Log., 1999

Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families".

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1999

1998

Games with Unknown Past.

[BibT_eX]

[DOI]

Alexander Yakhnis

Vladimir Yakhnis

Math. Log. Q., 1998

Computable Kripke Models and Intermediate Logics.

[BibT_eX]

[DOI]

Inf. Comput., 1998

Computable Isomorphisms, Degree Spectra of Relations, and Scott Families.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Randomness, Computability, and Algebraic Specifications.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Decidable Kripke Models of Intuitionistic Theories.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

1997

Computable Models of Theories with Few Models.

[BibT_eX]

[DOI]

André Nies

Notre Dame J. Formal Log., 1997

Effectiveness of the Completeness Theorem for an Intermediate Logic.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1997

Logic in Computer Science.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1997

Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?

[BibT_eX]

Cristian Calude

Peter Hertling

Bull. EATCS, 1997

Deterministic Automata: Simulation, Universality and Minimality.

[BibT_eX]

[DOI]

Cristian Calude

Elena Calude

Ann. Pure Appl. Log., 1997

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract.

[BibT_eX]

Cristian S. Calude

Elena Calude

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996

Categoricity and Scott Families.

[BibT_eX]

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1994

Recursive Unary Algebras and Trees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1994

The Notion of Rank and Games.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

Automatic Presentations of Structures.

[BibT_eX]

[DOI]