Giora Slutzki

Publication Activity (10 Years)

Years Active: 1973-2021
Publications (10 Years): 8

Top Topics

Description Logics

Top Venues

ACM Trans. Comput. Log.

ICAART (Revised Selected Papers)

Publications

Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki
Secrecy-preserving Reasoning in Acyclic DL-LiteR Knowledge Bases in the Presence of BCQs. ICAART (2) (2021)
Gopalakrishnan Krishnasamy Sivaprakasam, Giora Slutzki
Secrecy-preserving Reasoning in ELH Knowledge Bases using MapReduce Algorithm. ICAART (2) (2020)
Jack H. Lutz, Giora Slutzki
Nonregularity via Ordinal Extensions. CoRR (2020)
Gopalakrishnan Krishnasamy Sivaprakasam, Adrienne Raglin, Douglas Summers-Stay, Giora Slutzki
Secrecy-Preserving Reasoning and Query Answering in Probabilistic Description Logic Knowledge Bases. GCAI (2017)
Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki
Keeping Secrets in Modalized DL Knowledge Bases. ICAART (2) (2017)
Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki
Secrecy-Preserving Query Answering in ELH Knowledge Bases. ICAART (2) (2016)
Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki
^+ Knowledge Bases. ICAART (Revised Selected Papers) (2016)
Ganesh Ram Santhanam, Gopalakrishnan Sivaprakasam, Giora Slutzki, Samik Basu
A Knowledge Based Framework for Case-specific Diagnosis. ICAART (2) (2015)
Jia Tao, Giora Slutzki, Vasant G. Honavar
A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases. ACM Trans. Comput. Log. 16 (1) (2014)
Jia Tao, Giora Slutzki, Vasant G. Honavar
PSPACE Tableau Algorithms for Acyclic Modalized $\boldsymbol{\mathcal{ALC}}$. J. Autom. Reason. 49 (4) (2012)
Jia Tao, Giora Slutzki, Vasant G. Honavar
\mathcal{EL}. RR (2010)
Borislav H. Simov, Giora Slutzki, Steven M. LaValle
Clearing a Polygon with Two 1-Searchers. Int. J. Comput. Geom. Appl. 19 (1) (2009)
Jie Bao, George Voutsadakis, Giora Slutzki, Vasant G. Honavar
On the Decidability of Role Mappings between Modular Ontologies. AAAI (2008)
George Voutsadakis, Giora Slutzki, Vasant G. Honavar, Jie Bao
Federated ALCI: Preliminary Report. Web Intelligence (2008)
Jie Bao, Giora Slutzki, Vasant G. Honavar
Privacy-Preserving Reasoning on the SemanticWeb. Web Intelligence (2007)
Jie Bao, Giora Slutzki, Vasant G. Honavar
A Semantic Importing Approach to Knowledge Reuse from Multiple Ontologies. AAAI (2007)
Souvik Ray, Giora Slutzki, Zhao Zhang
Incentive-Driven P2P Anonymity System: A Game-Theoretic Approach. ICPP (2007)
Giora Slutzki, Oscar Volij
Scoring of web pages and tournaments - axiomatizations. Soc. Choice Welf. 26 (1) (2006)
Giora Slutzki, Oscar Volij
Ranking participants in generalized tournaments. Int. J. Game Theory 33 (2) (2005)
David Fernández-Baca, Timo Seppäläinen, Giora Slutzki
Parametric multiple sequence alignment and phylogeny construction. J. Discrete Algorithms 2 (2) (2004)
Clifford Bergman, Giora Slutzki
Computational complexity of some problems involving congruences on algebras. Theor. Comput. Sci. 270 (1-2) (2002)
David Fernández-Baca, Timo Seppäläinen, Giora Slutzki
Bounds for parametric sequence comparison. Discret. Appl. Math. 118 (3) (2002)
Steven M. LaValle, Borislav H. Simov, Giora Slutzki
An Algorithm for Searching a Polygonal Region with a Flashlight. Int. J. Comput. Geom. Appl. 12 (1-2) (2002)
Clifford Bergman, Giora Slutzki
Computational Complexity of Generators and Nongenerators in Algebra. Int. J. Algebra Comput. 12 (5) (2002)
Borislav H. Simov, Steven M. LaValle, Giora Slutzki
A Complete Pursuit-Evasion Algorithm for Two Pursuers using Beam Detection. ICRA (2002)
Steven M. LaValle, Borislav H. Simov, Giora Slutzki
An algorithm for searching a polygonal region with a flashlight. SCG (2000)
Clifford Bergman, Giora Slutzki
Computational Complexity of Some Problems Involving Congruences on Algebras. LICS (2000)
Clifford Bergman, Giora Slutzki
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras. SIAM J. Comput. 30 (2) (2000)
Borislav H. Simov, Giora Slutzki, Steven M. LaValle
Pursuit-Evasion Using Beam Detection. ICRA (2000)
David Fernández-Baca, Timo Seppäläinen, Giora Slutzki
Parametric Multiple Sequence Alignment and Phylogeny Construction. CPM (2000)
Clifford Bergman, Giora Slutzki
Complexity of Some Problems in Universal Algebra. STACS (1999)
Clifford Bergman, David Juedes, Giora Slutzki
Computational Complexity of Term-Equivalence. Int. J. Algebra Comput. 9 (1) (1999)
David Fernández-Baca, Timo Seppäläinen, Giora Slutzki
Bounds for Parametric Sequence Comparison. SPIRE/CRIWG (1999)
Bamshad Mobasher, Don Pigozzi, Giora Slutzki
Multi-Valued Logic Programming Semantics: An Algebraic Approach. Theor. Comput. Sci. 171 (1-2) (1997)
David Fernández-Baca, Giora Slutzki
Optimal Parametric Search on Graphs of Bounded Tree-Width. J. Algorithms 22 (2) (1997)
David Fernández-Baca, Giora Slutzki
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. Theor. Comput. Sci. 181 (1) (1997)
Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki
Distributing Tokens on a Hypercube without Error Accumulation. IPPS (1996)
Giora Slutzki, Sándor Vágvölgyi
A Hierarchy of Deterministic Top-Down Tree Transformations. Math. Syst. Theory 29 (2) (1996)
David Fernández-Baca, Giora Slutzki, David Eppstein
Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. 3 (4) (1996)
David Fernández-Baca, Giora Slutzki, David Eppstein
Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT (1996)
David Fernández-Baca, Giora Slutzki
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. LATIN (1995)
Pranava K. Jha, Giora Slutzki
A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube. Inf. Process. Lett. 55 (3) (1995)
Richa Agarwala, David Fernández-Baca, Giora Slutzki
Fast Algorithms for Inferring Evolutionary Trees. J. Comput. Biol. 2 (3) (1995)
Giora Slutzki, Sándor Vágvölgyi
Deterministic Top-Down Tree Transducers with Iterated Lookahead. Theor. Comput. Sci. 143 (2) (1995)
John H. Leuchner, Les Miller, Giora Slutzki
A Note on the Equivalence of a Set of Egds to a Set of FDs. Inf. Process. Lett. 49 (4) (1994)
Craig A. Rich, Giora Slutzki
The Complexity of Optimizing Finite-State Transducers. Theor. Comput. Sci. 129 (2) (1994)
David Fernández-Baca, Giora Slutzki
Parametric Problems on Graphs of Bounded Tree-Width. J. Algorithms 16 (3) (1994)
David Fernández-Baca, Giora Slutzki
Optimal Parametric Search on Graphs of Bounded Tree-Width. SWAT (1994)
Giora Slutzki, Sándor Vágvölgyi
A Hierarchy of Deterministic Top-down Tree Transformations. FCT (1993)
David Fernández-Baca, Giora Slutzki
Parametric Problems on Graphs of Bounded Tree-Width. SWAT (1992)
John H. Leuchner, Les Miller, Giora Slutzki
Agreement Graph Dependencies. Bull. EATCS 45 (1991)
Craig A. Rich, Giora Slutzki
The complexity of a counting finite-state automation. Acta Cybern. 9 (4) (1990)
David Fernández-Baca, Giora Slutzki
Solving Parametric Problems on Trees. J. Algorithms 10 (3) (1989)
Rattikorn Hewett, Giora Slutzki
Comparisons Between Some Pumping Conditions for Context-Free Languages. Math. Syst. Theory 21 (4) (1989)
R. Boonyavatana, Giora Slutzki
The Interchange or Pump (Di)Lemmas for Context-Free Languages. Theor. Comput. Sci. 56 (1988)
David Fernández-Baca, Giora Slutzki
Solving Parametric Problems on Trees. STACS (1988)
John H. Leuchner, Les Miller, Giora Slutzki
A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies. SIGMOD Conference (1988)
R. Boonyavatana, Giora Slutzki
Note: on the sufficiency of Igarashi's conditions for real-time deterministic context-free-languages. Bull. EATCS 31 (1987)
R. Boonyavatana, Giora Slutzki
Ogden's Lemma for Monterminal Bounded Languages. RAIRO Theor. Informatics Appl. 20 (4) (1986)
R. Boonyavatana, Giora Slutzki
A generalized Ogden's lema for linear conteext-free languages. Bull. EATCS 28 (1986)
Giora Slutzki
Alternating Tree Automata. Theor. Comput. Sci. 41 (1985)
Joost Engelfriet, Giora Slutzki
Extended Macro Grammars and Stack Controlled Machines. J. Comput. Syst. Sci. 29 (3) (1984)
Giora Slutzki
Alternating Tree Automata. CAAP (1983)
Giora Slutzki
Finite State Relational Programs. Acta Informatica 18 (1982)
Tsutomu Kamimura, Giora Slutzki
Transductions of Dags and Trees. Math. Syst. Theory 15 (3) (1982)
Tsutomu Kamimura, Giora Slutzki
Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs Inf. Control. 49 (1) (1981)
Amir Pnueli, Giora Slutzki
Automatic Programming of Finite State Linear Programs. SIAM J. Comput. 10 (3) (1981)
Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki
Tree Transducers, L Systems, and Two-Way Machines. J. Comput. Syst. Sci. 20 (2) (1980)
Giora Slutzki
Descriptional Complexity of Concurrent Processes (preliminary version). MFCS (1980)
Tsutomu Kamimura, Giora Slutzki
DAGs and Chomsky Hierarchy (Extended Abstract). ICALP (1979)
Joost Engelfriet, Giora Slutzki
Bounded Nesting in Macro Grammars Inf. Control. 42 (2) (1979)
Tsutomu Kamimura, Giora Slutzki
Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract). MFCS (1979)
Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki
Tree Transducers, L Systems and Two-Way Machines (Extended Abstract) STOC (1978)
Amir Pnueli, Giora Slutzki
Simple Programs and Their Decision Problems. ICALP (1977)
Nissim Francez, Giora Slutzki
On the Non-Compactness of the Class of Program Schemas. Inf. Process. Lett. 2 (5) (1973)