Giora Slutzki - RankMe

78 papers A* 8A 2B 6Journal 41Unranked 18

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