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