# Giora Slutzki

According to our database1, Giora Slutzki authored at least 62 papers between 1973 and 2017.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2017
Keeping Secrets in Modalized DL Knowledge Bases.
Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Secrecy-Preserving Reasoning and Query Answering in Probabilistic Description Logic Knowledge Bases.
Proceedings of the GCAI 2017, 2017

2016
Keeping Secrets in EL^+ Knowledge Bases.
Proceedings of the Agents and Artificial Intelligence - 8th International Conference, 2016

Secrecy-Preserving Query Answering in ELH Knowledge Bases.
Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2016

2015
A Knowledge Based Framework for Case-specific Diagnosis.
Proceedings of the ICAART 2015, 2015

2014
A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases.
ACM Trans. Comput. Log., 2014

2012
PSPACE Tableau Algorithms for Acyclic Modalized $\boldsymbol{\mathcal{ALC}}$.
J. Autom. Reasoning, 2012

2010
Secrecy-Preserving Query Answering for Instance Checking in EL\mathcal{EL}.
Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

2009
Package-Based Description Logics.
Proceedings of the Modular Ontologies: Concepts, 2009

Clearing a Polygon with Two 1-Searchers.
Int. J. Comput. Geometry Appl., 2009

2008
Federated ALCI: Preliminary Report.
Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

On the Decidability of Role Mappings between Modular Ontologies.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Privacy-Preserving Reasoning on the SemanticWeb.
Proceedings of the 2007 IEEE / WIC / ACM International Conference on Web Intelligence, 2007

Incentive-Driven P2P Anonymity System: A Game-Theoretic Approach.
Proceedings of the 2007 International Conference on Parallel Processing (ICPP 2007), 2007

A Semantic Importing Approach to Knowledge Reuse from Multiple Ontologies.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Scoring of web pages and tournaments - axiomatizations.
Social Choice and Welfare, 2006

2005
Ranking participants in generalized tournaments.
Int. J. Game Theory, 2005

2002
Computational Complexity of Generators and Nongenerators in Algebra.
IJAC, 2002

A Complete Pursuit-Evasion Algorithm for Two Pursuers using Beam Detection.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

2000
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras.
SIAM J. Comput., 2000

Computational Complexity of Some Problems Involving Congruences on Algebras.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Pursuit-Evasion Using Beam Detection.
Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000

Parametric Multiple Sequence Alignment and Phylogeny Construction.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

An algorithm for searching a polygonal region with a flashlight.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Computational Complexity of Term-Equivalence.
IJAC, 1999

Complexity of Some Problems in Universal Algebra.
Proceedings of the STACS 99, 1999

Bounds for Parametric Sequence Comparison.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

1997
Multi-Valued Logic Programming Semantics: An Algebraic Approach.
Theor. Comput. Sci., 1997

1996
Using Sparsification for Parametric Minimum Spanning Tree Problems.
Proceedings of the Algorithm Theory, 1996

Distributing Tokens on a Hypercube without Error Accumulation.
Proceedings of IPPS '96, 1996

1995
Deterministic Top-Down Tree Transducers with Iterated Lookahead.
Theor. Comput. Sci., 1995

Fast Algorithms for Inferring Evolutionary Trees.
Journal of Computational Biology, 1995

A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube.
Inf. Process. Lett., 1995

Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
The Complexity of Optimizing Finite-State Transducers.
Theor. Comput. Sci., 1994

A Note on the Equivalence of a Set of Egds to a Set of FDs.
Inf. Process. Lett., 1994

Optimal Parametric Search on Graphs of Bounded Tree-Width.
Proceedings of the Algorithm Theory, 1994

1993
A Hierarchy of Deterministic Top-down Tree Transformations.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
Parametric Problems on Graphs of Bounded Tree-Width.
Proceedings of the Algorithm Theory, 1992

1991
Agreement Graph Dependencies.
Bulletin of the EATCS, 1991

1990
The complexity of a counting finite-state automation.
Acta Cybern., 1990

1989
Comparisons Between Some Pumping Conditions for Context-Free Languages.
Mathematical Systems Theory, 1989

1988
The Interchange or Pump (Di)Lemmas for Context-Free Languages.
Theor. Comput. Sci., 1988

Solving Parametric Problems on Trees.
Proceedings of the STACS 88, 1988

A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies.
Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

1987
Note: on the sufficiency of Igarashi's conditions for real-time deterministic context-free-languages.
Bulletin of the EATCS, 1987

1986
Ogden's Lemma for Monterminal Bounded Languages.
ITA, 1986

A generalized Ogden's lema for linear conteext-free languages.
Bulletin of the EATCS, 1986

1984
Extended Macro Grammars and Stack Controlled Machines.
J. Comput. Syst. Sci., 1984

1983
Alternating Tree Automata.
Proceedings of the CAAP'83, 1983

1982
Transductions of Dags and Trees.
Mathematical Systems Theory, 1982

Finite State Relational Programs.
Acta Inf., 1982

1981
Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs
Information and Control, April, 1981

Automatic Programming of Finite State Linear Programs.
SIAM J. Comput., 1981

1980
Tree Transducers, L Systems, and Two-Way Machines.
J. Comput. Syst. Sci., 1980

Descriptional Complexity of Concurrent Processes (preliminary version).
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
Bounded Nesting in Macro Grammars
Information and Control, August, 1979

Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

DAGs and Chomsky Hierarchy (Extended Abstract).
Proceedings of the Automata, 1979

1978
Tree Transducers, L Systems and Two-Way Machines (Extended Abstract)
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977
Simple Programs and Their Decision Problems.
Proceedings of the Automata, 1977

1973
On the Non-Compactness of the Class of Program Schemas.
Inf. Process. Lett., 1973