Giora Slutzki

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2010
62Secrecy-Preserving Query Answering for Instance Checking in EL\\mathcal{EL}. Jia Tao, Giora Slutzki, Vasant Honavar. RR 2010, 195-203. Web SearchBibTeXDownload
2009
61Clearing a Polygon with Two 1-Searchers. Borislav H. Simov, Giora Slutzki, Steven M. LaValle. Int. J. Comput. Geometry Appl. (19): 59-92 (2009). Web SearchBibTeXDownload
60Package-Based Description Logics. Jie Bao, George Voutsadakis, Giora Slutzki, Vasant Honavar. Modular Ontologies 2009, 349-371. Web SearchBibTeXDownload
2008
59On the Decidability of Role Mappings between Modular Ontologies. Jie Bao, George Voutsadakis, Giora Slutzki, Vasant Honavar. AAAI 2008, 400-405. Web SearchBibTeX
58Federated ALCI: Preliminary Report. George Voutsadakis, Giora Slutzki, Vasant Honavar, Jie Bao. Web Intelligence 2008, 575-578. Web SearchBibTeXDownload
2007
57A Semantic Importing Approach to Knowledge Reuse from Multiple Ontologies. Jie Bao, Giora Slutzki, Vasant Honavar. AAAI 2007, 1304-1309. Web SearchBibTeX
56Incentive-Driven P2P Anonymity System: A Game-Theoretic Approach. Souvik Ray, Giora Slutzki, Zhao Zhang. ICPP 2007, 63. Web SearchBibTeXDownload
55Privacy-Preserving Reasoning on the SemanticWeb. Jie Bao, Giora Slutzki, Vasant Honavar. Web Intelligence 2007, 791-797. Web SearchBibTeXDownload
2004
54Parametric multiple sequence alignment and phylogeny construction. David Fernández-Baca, Timo Seppäläinen, Giora Slutzki. J. Discrete Algorithms (2): 271-287 (2004). Web SearchBibTeXDownload
2002
53Bounds for parametric sequence comparison. David Fernández-Baca, Timo Seppäläinen, Giora Slutzki. Discrete Applied Mathematics (118): 181-198 (2002). Web SearchBibTeXDownload
52A Complete Pursuit-Evasion Algorithm for Two Pursuers using Beam Detection. Borislav H. Simov, Steven M. LaValle, Giora Slutzki. ICRA 2002, 618-623. Web SearchBibTeX
51Computational Complexity of Generators and Nongenerators in Algebra. Clifford Bergman, Giora Slutzki. IJAC (12): 719-735 (2002). Web SearchBibTeXDownload
50An Algorithm for Searching a Polygonal Region with a Flashlight. Steven M. LaValle, Borislav H. Simov, Giora Slutzki. Int. J. Comput. Geometry Appl. (12): 87-113 (2002). Web SearchBibTeX
49Computational complexity of some problems involving congruences on algebras. Clifford Bergman, Giora Slutzki. Theor. Comput. Sci. (270): 591-608 (2002). Web SearchBibTeXDownload
2000
48Parametric Multiple Sequence Alignment and Phylogeny Construction. David Fernández-Baca, Timo Seppäläinen, Giora Slutzki. CPM 2000, 69-83. Web SearchBibTeXDownload
47Pursuit-Evasion Using Beam Detection. Borislav H. Simov, Giora Slutzki, Steven M. LaValle. ICRA 2000, 1657-1662. Web SearchBibTeX
46Computational Complexity of Some Problems Involving Congruences on Algebras. Clifford Bergman, Giora Slutzki. LICS 2000, 168-174. Web SearchBibTeXDownload
45Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras. Clifford Bergman, Giora Slutzki. SIAM J. Comput. (30): 359-382 (2000). Web SearchBibTeXDownload
44An algorithm for searching a polygonal region with a flashlight. Steven M. LaValle, Borislav H. Simov, Giora Slutzki. Symposium on Computational Geometry 2000, 260-269. Web SearchBibTeXDownload
1999
43Bounds for Parametric Sequence Comparison. David Fernández-Baca, Timo Seppäläinen, Giora Slutzki. SPIRE/CRIWG 1999, 55-62. Web SearchBibTeXDownload
42Complexity of Some Problems in Universal Algebra. Clifford Bergman, Giora Slutzki. STACS 1999, 163-172. Web SearchBibTeXDownload
1997
41Optimal Parametric Search on Graphs of Bounded Tree-Width. David Fernández-Baca, Giora Slutzki. J. Algorithms (22): 212-240 (1997). Web SearchBibTeXDownload
40Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. David Fernández-Baca, Giora Slutzki. Theor. Comput. Sci. (181): 57-74 (1997). Web SearchBibTeXDownload
39Multi-Valued Logic Programming Semantics: An Algebraic Approach. Bamshad Mobasher, Don Pigozzi, Giora Slutzki. Theor. Comput. Sci. (171): 77-109 (1997). Web SearchBibTeXDownload
1996
38Distributing Tokens on a Hypercube without Error Accumulation. Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki. IPPS 1996, 573-578. Web SearchBibTeXDownload
37A Hierarchy of Deterministic Top-Down Tree Transformations. Giora Slutzki, Sándor Vágvölgyi. Mathematical Systems Theory (29): 169-188 (1996). Web SearchBibTeXDownload
36Using Sparsification for Parametric Minimum Spanning Tree Problems. David Fernández-Baca, Giora Slutzki, David Eppstein. SWAT 1996, 149-160. Web SearchBibTeXDownload
1995
35A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube. Pranava K. Jha, Giora Slutzki. Inf. Process. Lett. (55): 123-127 (1995). Web SearchBibTeXDownload
34Fast Algorithms for Inferring Evolutionary Trees. Richa Agarwala, David Fernández-Baca, Giora Slutzki. Journal of Computational Biology (2): 397-407 (1995). Web SearchBibTeX
33Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. David Fernández-Baca, Giora Slutzki. LATIN 1995, 257-271. Web SearchBibTeXDownload
32Deterministic Top-Down Tree Transducers with Iterated Lookahead. Giora Slutzki, Sándor Vágvölgyi. Theor. Comput. Sci. (143): 285-308 (1995). Web SearchBibTeXDownload
1994
31A Note on the Equivalence of a Set of Egds to a Set of FDs. John H. Leuchner, Les Miller, Giora Slutzki. Inf. Process. Lett. (49): 185-188 (1994). Web SearchBibTeXDownload
30Parametric Problems on Graphs of Bounded Tree-Width. David Fernández-Baca, Giora Slutzki. J. Algorithms (16): 408-430 (1994). Web SearchBibTeXDownload
29Optimal Parametric Search on Graphs of Bounded Tree-Width. David Fernández-Baca, Giora Slutzki. SWAT 1994, 155-166. Web SearchBibTeXDownload
28The Complexity of Optimizing Finite-State Transducers. Craig A. Rich, Giora Slutzki. Theor. Comput. Sci. (129): 323-336 (1994). Web SearchBibTeXDownload
1993
27A Hierarchy of Deterministic Top-down Tree Transformations. Giora Slutzki, Sándor Vágvölgyi. FCT 1993, 440-451. Web SearchBibTeXDownload
1992
26Parametric Problems on Graphs of Bounded Tree-Width. David Fernández-Baca, Giora Slutzki. SWAT 1992, 304-316. Web SearchBibTeXDownload
1991
25Agreement Graph Dependencies. John H. Leuchner, Les Miller, Giora Slutzki. Bulletin of the EATCS (45): 202-217 (1991). Web SearchBibTeX
1990
24The complexity of a counting finite-state automation. Craig A. Rich, Giora Slutzki. Acta Cybern. (9): 403-417 (1990). Web SearchBibTeX
1989
23Solving Parametric Problems on Trees. David Fernández-Baca, Giora Slutzki. J. Algorithms (10): 381-402 (1989). Web SearchBibTeXDownload
22Comparisons Between Some Pumping Conditions for Context-Free Languages. Rattikorn Hewett, Giora Slutzki. Mathematical Systems Theory (21): 223-233 (1989). Web SearchBibTeXDownload
1988
21A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies. John H. Leuchner, Les Miller, Giora Slutzki. SIGMOD Conference 1988, 218-224. Web SearchBibTeX
20Solving Parametric Problems on Trees. David Fernández-Baca, Giora Slutzki. STACS 1988, 52-60. Web SearchBibTeXDownload
19The Interchange or Pump (Di)Lemmas for Context-Free Languages. R. Boonyavatana, Giora Slutzki. Theor. Comput. Sci. (56): 321-338 (1988). Web SearchBibTeXDownload
1987
18Note: on the sufficiency of Igarashi's conditions for real-time deterministic context-free-languages. R. Boonyavatana, Giora Slutzki. Bulletin of the EATCS (31): 9-11 (1987). Web SearchBibTeX
1986
17A generalized Ogden's lema for linear conteext-free languages. R. Boonyavatana, Giora Slutzki. Bulletin of the EATCS (28): 20-25 (1986). Web SearchBibTeX
16Ogden's Lemma for Monterminal Bounded Languages. R. Boonyavatana, Giora Slutzki. ITA (20): 457-471 (1986). Web SearchBibTeX
1985
15Alternating Tree Automata. Giora Slutzki. Theor. Comput. Sci. (41): 305-318 (1985). Web SearchBibTeXDownload
1984
14Extended Macro Grammars and Stack Controlled Machines. Joost Engelfriet, Giora Slutzki. J. Comput. Syst. Sci. (29): 366-408 (1984). Web SearchBibTeXDownload
1983
13Alternating Tree Automata. Giora Slutzki. CAAP 1983, 392-404. Web SearchBibTeXDownload
1982
12Finite State Relational Programs. Giora Slutzki. Acta Inf. (18): 393-409 (1982). Web SearchBibTeXDownload
11Transductions of Dags and Trees. Tsutomu Kamimura, Giora Slutzki. Mathematical Systems Theory (15): 225-249 (1982). Web SearchBibTeXDownload
1981
10Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs. Tsutomu Kamimura, Giora Slutzki. Information and Control (49): 10-51 (1981). Web SearchBibTeXDownload
9Automatic Programming of Finite State Linear Programs. Amir Pnueli, Giora Slutzki. SIAM J. Comput. (10): 519-535 (1981). Web SearchBibTeXDownload
1980
8Tree Transducers, L Systems, and Two-Way Machines. Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki. J. Comput. Syst. Sci. (20): 150-202 (1980). Web SearchBibTeXDownload
7Descriptional Complexity of Concurrent Processes (preliminary version). Giora Slutzki. MFCS 1980, 601-611. Web SearchBibTeXDownload
1979
6DAGs and Chomsky Hierarchy (Extended Abstract). Tsutomu Kamimura, Giora Slutzki. ICALP 1979, 331-337. Web SearchBibTeXDownload
5Bounded Nesting in Macro Grammars. Joost Engelfriet, Giora Slutzki. Information and Control (42): 157-193 (1979). Web SearchBibTeXDownload
4Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract). Tsutomu Kamimura, Giora Slutzki. MFCS 1979, 317-325. Web SearchBibTeXDownload
1978
3Tree Transducers, L Systems and Two-Way Machines (Extended Abstract). Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki. STOC 1978, 66-74. Web SearchBibTeXDownload
1977
2Simple Programs and Their Decision Problems. Amir Pnueli, Giora Slutzki. ICALP 1977, 380-390. Web SearchBibTeXDownload
1973
1On the Non-Compactness of the Class of Program Schemas. Nissim Francez, Giora Slutzki. Inf. Process. Lett. (2): 141-142 (1973). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research