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