( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Keeping Secrets in Modalized DL Knowledge Bases.

, и . ICAART (2), стр. 591-598. SciTePress, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Giora Baum

Anna Gioran

 

Другие публикации лиц с тем же именем

Alternating Tree Automata.. Theor. Comput. Sci., (1985)Keeping Secrets in Modalized DL Knowledge Bases., и . ICAART (2), стр. 591-598. SciTePress, (2017)A Hierarchy of Deterministic Top-down Tree Transformations., и . FCT, том 710 из Lecture Notes in Computer Science, стр. 440-451. Springer, (1993)Keeping Secrets in EL^+ Knowledge Bases., и . ICAART (Revised Selected Papers), том 10162 из Lecture Notes in Computer Science, стр. 229-246. (2016)A Complete Pursuit-Evasion Algorithm for Two Pursuers using Beam Detection., , и . ICRA, стр. 618-623. IEEE, (2002)Tree Transducers, L Systems and Two-Way Machines (Extended Abstract), , и . STOC, стр. 66-74. ACM, (1978)A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies., , и . SIGMOD Conference, стр. 218-224. ACM Press, (1988)SIGMOD Record 17(3), September 1988.Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs., и . LATIN, том 911 из Lecture Notes in Computer Science, стр. 257-271. Springer, (1995)Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract)., и . MFCS, том 74 из Lecture Notes in Computer Science, стр. 317-325. Springer, (1979)Parametric Problems on Graphs of Bounded Tree-Width., и . SWAT, том 621 из Lecture Notes in Computer Science, стр. 304-316. Springer, (1992)