default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiora Slutzki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c34]Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki:
Secrecy-preserving Reasoning in Acyclic DL-LiteR Knowledge Bases in the Presence of BCQs. ICAART (2) 2021: 360-372- 2020
- [c33]Gopalakrishnan Krishnasamy Sivaprakasam, Giora Slutzki:
Secrecy-preserving Reasoning in ELH Knowledge Bases using MapReduce Algorithm. ICAART (2) 2020: 708-716 - [i1]Jack H. Lutz, Giora Slutzki:
Nonregularity via Ordinal Extensions. CoRR abs/2001.08846 (2020)
2010 – 2019
- 2017
- [c32]Gopalakrishnan Krishnasamy Sivaprakasam, Adrienne Raglin, Douglas Summers-Stay, Giora Slutzki:
Secrecy-Preserving Reasoning and Query Answering in Probabilistic Description Logic Knowledge Bases. GCAI 2017: 188-201 - [c31]Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki:
Keeping Secrets in Modalized DL Knowledge Bases. ICAART (2) 2017: 591-598 - 2016
- [c30]Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki:
Secrecy-Preserving Query Answering in ELH Knowledge Bases. ICAART (2) 2016: 149-159 - [c29]Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki:
Keeping Secrets in EL^+ Knowledge Bases. ICAART (Revised Selected Papers) 2016: 229-246 - 2015
- [c28]Ganesh Ram Santhanam, Gopalakrishnan Sivaprakasam, Giora Slutzki, Samik Basu:
A Knowledge Based Framework for Case-specific Diagnosis. ICAART (2) 2015: 482-488 - 2014
- [j40]Jia Tao, Giora Slutzki, Vasant G. Honavar
:
A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases. ACM Trans. Comput. Log. 16(1): 3:1-3:32 (2014) - 2012
- [j39]Jia Tao, Giora Slutzki, Vasant G. Honavar:
PSPACE Tableau Algorithms for Acyclic Modalized $\boldsymbol{\mathcal{ALC}}$. J. Autom. Reason. 49(4): 551-582 (2012) - 2010
- [c27]Jia Tao, Giora Slutzki, Vasant G. Honavar:
Secrecy-Preserving Query Answering for Instance Checking in EL\mathcal{EL}. RR 2010: 195-203
2000 – 2009
- 2009
- [j38]Borislav H. Simov, Giora Slutzki, Steven M. LaValle:
Clearing a Polygon with Two 1-Searchers. Int. J. Comput. Geom. Appl. 19(1): 59-92 (2009) - [p1]Jie Bao, George Voutsadakis, Giora Slutzki, Vasant G. Honavar:
Package-Based Description Logics. Modular Ontologies 2009: 349-371 - 2008
- [c26]Jie Bao, George Voutsadakis, Giora Slutzki, Vasant G. Honavar:
On the Decidability of Role Mappings between Modular Ontologies. AAAI 2008: 400-405 - [c25]George Voutsadakis, Giora Slutzki, Vasant G. Honavar, Jie Bao:
Federated ALCI: Preliminary Report. Web Intelligence 2008: 575-578 - 2007
- [c24]Jie Bao, Giora Slutzki, Vasant G. Honavar:
A Semantic Importing Approach to Knowledge Reuse from Multiple Ontologies. AAAI 2007: 1304-1309 - [c23]Souvik Ray, Giora Slutzki, Zhao Zhang:
Incentive-Driven P2P Anonymity System: A Game-Theoretic Approach. ICPP 2007: 63 - [c22]Jie Bao, Giora Slutzki, Vasant G. Honavar:
Privacy-Preserving Reasoning on the SemanticWeb. Web Intelligence 2007: 791-797 - 2006
- [j37]Giora Slutzki, Oscar Volij:
Scoring of web pages and tournaments - axiomatizations. Soc. Choice Welf. 26(1): 75-92 (2006) - 2005
- [j36]Giora Slutzki, Oscar Volij:
Ranking participants in generalized tournaments. Int. J. Game Theory 33(2): 255-270 (2005) - 2004
- [j35]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
- [j34]David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Bounds for parametric sequence comparison. Discret. Appl. Math. 118(3): 181-198 (2002) - [j33]Clifford Bergman, Giora Slutzki:
Computational Complexity of Generators and Nongenerators in Algebra. Int. J. Algebra Comput. 12(5): 719-735 (2002) - [j32]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): 87-113 (2002) - [j31]Clifford Bergman, Giora Slutzki:
Computational complexity of some problems involving congruences on algebras. Theor. Comput. Sci. 270(1-2): 591-608 (2002) - [c21]Borislav H. Simov, Steven M. LaValle, Giora Slutzki:
A Complete Pursuit-Evasion Algorithm for Two Pursuers using Beam Detection. ICRA 2002: 618-623 - 2000
- [j30]Clifford Bergman, Giora Slutzki:
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras. SIAM J. Comput. 30(2): 359-382 (2000) - [c20]Steven M. LaValle, Borislav H. Simov, Giora Slutzki:
An algorithm for searching a polygonal region with a flashlight. SCG 2000: 260-269 - [c19]David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Parametric Multiple Sequence Alignment and Phylogeny Construction. CPM 2000: 69-83 - [c18]Borislav H. Simov, Giora Slutzki, Steven M. LaValle:
Pursuit-Evasion Using Beam Detection. ICRA 2000: 1657-1662 - [c17]Clifford Bergman, Giora Slutzki:
Computational Complexity of Some Problems Involving Congruences on Algebras. LICS 2000: 168-174
1990 – 1999
- 1999
- [j29]Clifford Bergman, David Juedes, Giora Slutzki:
Computational Complexity of Term-Equivalence. Int. J. Algebra Comput. 9(1): 113-128 (1999) - [c16]David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Bounds for Parametric Sequence Comparison. SPIRE/CRIWG 1999: 55-62 - [c15]Clifford Bergman, Giora Slutzki:
Complexity of Some Problems in Universal Algebra. STACS 1999: 163-172 - 1998
- [e1]Vasant G. Honavar, Giora Slutzki:
Grammatical Inference, 4th International Colloquium, ICGI-98, Ames, Iowa, USA, July 12-14, 1998, Proceedings. Lecture Notes in Computer Science 1433, Springer 1998, ISBN 3-540-64776-7 [contents] - 1997
- [j28]David Fernández-Baca, Giora Slutzki:
Optimal Parametric Search on Graphs of Bounded Tree-Width. J. Algorithms 22(2): 212-240 (1997) - [j27]Bamshad Mobasher, Don Pigozzi, Giora Slutzki:
Multi-Valued Logic Programming Semantics: An Algebraic Approach. Theor. Comput. Sci. 171(1-2): 77-109 (1997) - [j26]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
- [j25]Giora Slutzki, Sándor Vágvölgyi:
A Hierarchy of Deterministic Top-Down Tree Transformations. Math. Syst. Theory 29(2): 169-188 (1996) - [j24]David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. 3(4): 352-366 (1996) - [c14]Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki:
Distributing Tokens on a Hypercube without Error Accumulation. IPPS 1996: 573-578 - [c13]David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT 1996: 149-160 - 1995
- [j23]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) - [j22]Richa Agarwala, David Fernández-Baca, Giora Slutzki:
Fast Algorithms for Inferring Evolutionary Trees. J. Comput. Biol. 2(3): 397-407 (1995) - [j21]Giora Slutzki, Sándor Vágvölgyi:
Deterministic Top-Down Tree Transducers with Iterated Lookahead. Theor. Comput. Sci. 143(2): 285-308 (1995) - [c12]David Fernández-Baca, Giora Slutzki:
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. LATIN 1995: 257-271 - 1994
- [j20]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) - [j19]David Fernández-Baca, Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width. J. Algorithms 16(3): 408-430 (1994) - [j18]Craig A. Rich, Giora Slutzki:
The Complexity of Optimizing Finite-State Transducers. Theor. Comput. Sci. 129(2): 323-336 (1994) - [c11]David Fernández-Baca, Giora Slutzki:
Optimal Parametric Search on Graphs of Bounded Tree-Width. SWAT 1994: 155-166 - 1993
- [c10]Giora Slutzki, Sándor Vágvölgyi:
A Hierarchy of Deterministic Top-down Tree Transformations. FCT 1993: 440-451 - 1992
- [c9]David Fernández-Baca, Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width. SWAT 1992: 304-316 - 1991
- [j17]John H. Leuchner, Les Miller, Giora Slutzki:
Agreement Graph Dependencies. Bull. EATCS 45: 202-217 (1991) - 1990
- [j16]Craig A. Rich, Giora Slutzki:
The complexity of a counting finite-state automation. Acta Cybern. 9(4): 403-417 (1990)
1980 – 1989
- 1989
- [j15]David Fernández-Baca, Giora Slutzki:
Solving Parametric Problems on Trees. J. Algorithms 10(3): 381-402 (1989) - [j14]Rattikorn Hewett, Giora Slutzki:
Comparisons Between Some Pumping Conditions for Context-Free Languages. Math. Syst. Theory 21(4): 223-233 (1989) - 1988
- [j13]R. Boonyavatana, Giora Slutzki:
The Interchange or Pump (Di)Lemmas for Context-Free Languages. Theor. Comput. Sci. 56: 321-338 (1988) - [c8]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 - [c7]David Fernández-Baca, Giora Slutzki:
Solving Parametric Problems on Trees. STACS 1988: 52-60 - 1987
- [j12]R. Boonyavatana, Giora Slutzki:
Note: on the sufficiency of Igarashi's conditions for real-time deterministic context-free-languages. Bull. EATCS 31: 9-11 (1987) - 1986
- [j11]R. Boonyavatana, Giora Slutzki:
A generalized Ogden's lema for linear conteext-free languages. Bull. EATCS 28: 20-25 (1986) - [j10]R. Boonyavatana, Giora Slutzki:
Ogden's Lemma for Monterminal Bounded Languages. RAIRO Theor. Informatics Appl. 20(4): 457-471 (1986) - 1985
- [j9]Giora Slutzki:
Alternating Tree Automata. Theor. Comput. Sci. 41: 305-318 (1985) - 1984
- [j8]Joost Engelfriet, Giora Slutzki:
Extended Macro Grammars and Stack Controlled Machines. J. Comput. Syst. Sci. 29(3): 366-408 (1984) - 1983
- [c6]Giora Slutzki:
Alternating Tree Automata. CAAP 1983: 392-404 - 1982
- [j7]Giora Slutzki:
Finite State Relational Programs. Acta Informatica 18: 393-409 (1982) - [j6]Tsutomu Kamimura, Giora Slutzki:
Transductions of Dags and Trees. Math. Syst. Theory 15(3): 225-249 (1982) - 1981
- [j5]Tsutomu Kamimura, Giora Slutzki:
Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs. Inf. Control. 49(1): 10-51 (1981) - [j4]Amir Pnueli, Giora Slutzki:
Automatic Programming of Finite State Linear Programs. SIAM J. Comput. 10(3): 519-535 (1981) - 1980
- [j3]Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki:
Tree Transducers, L Systems, and Two-Way Machines. J. Comput. Syst. Sci. 20(2): 150-202 (1980) - [c5]Giora Slutzki:
Descriptional Complexity of Concurrent Processes (preliminary version). MFCS 1980: 601-611
1970 – 1979
- 1979
- [j2]Joost Engelfriet, Giora Slutzki:
Bounded Nesting in Macro Grammars. Inf. Control. 42(2): 157-193 (1979) - [c4]Tsutomu Kamimura, Giora Slutzki:
DAGs and Chomsky Hierarchy (Extended Abstract). ICALP 1979: 331-337 - [c3]Tsutomu Kamimura, Giora Slutzki:
Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract). MFCS 1979: 317-325 - 1978
- [c2]Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki:
Tree Transducers, L Systems and Two-Way Machines (Extended Abstract). STOC 1978: 66-74 - 1977
- [c1]Amir Pnueli, Giora Slutzki:
Simple Programs and Their Decision Problems. ICALP 1977: 380-390 - 1976
- [b1]Giora Slutzki:
Logical analysis of simple programs. Tel Aviv University, Israel, 1976 - 1973
- [j1]Nissim Francez, Giora Slutzki:
On the Non-Compactness of the Class of Program Schemas. Inf. Process. Lett. 2(5): 141-142 (1973)
Coauthor Index
aka: Gopalakrishnan Krishnaswamy Sivaprakasam
aka: Gopalakrishnan Krishnasamy Sivaprakasam
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
