Result 1 to 20 of 127 total
Complete problem for perfect zero-knowledge quantum proof. (English)
Bieliková, Mária (ed.) et al., SOFSEM 2012: Theory and practice of computer science. 38th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 21‒27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27659-0/pbk). Lecture Notes in Computer Science 7147, 419-430 (2012).
1
An ontology-based method for measurement of transferability and complexity of knowledge in multi-site software development environment. (English)
Theeramunkong, Thanaruk (ed.) et al., Knowledge, information, and creativity support systems. 5th international conference, KICSS 2010, Chiang Mai, Thailand, November 25‒27, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24787-3/pbk). Lecture Notes in Computer Science 6746. Lecture Notes in Artificial Intelligence, 238-252 (2011).
2
A heuristic knowledge-reduction method for decision formal contexts. (English)
Comput. Math. Appl. 61, No. 4, 1096-1106 (2011).
3
Querying the fragments of English. (English)
Beklemishev, Lev D. (ed.) et al., Logic, language, information and computation. 18th international workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20919-2/pbk). Lecture Notes in Computer Science 6642. Lecture Notes in Artificial Intelligence, 257-271 (2011).
4
Outlier detection for simple default theories. (English)
Artif. Intell. 174, No. 15, 1247-1253 (2010).
5
Computational complexity and anytime algorithm for inconsistency measurement. (English)
Int. J. Softw. Inform. 4, No. 1, 3-21 (2010).
6
Ontology based approach in knowledge sharing measurement. (English)
J. UCS 16, No. 6, 956-982, electronic only (2010).
7
Unification in the description logic EL. (English)
Log. Methods Comput. Sci. 6, No. 3, Paper No. 17, 31 p., electronic only (2010).
8
Minimal assumptions and round complexity for concurrent zero-knowledge in the bare public-key model. (English)
Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13‒15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 127-137 (2009).
9
New and improved constructions of nonmalleable cryptographic protocols. (English)
SIAM J. Comput. 38, No. 2, 702-752 (2008).
10
Outlier detection using default reasoning. (English)
Artif. Intell. 172, No. 16-17, 1837-1872 (2008).
11
Semantic forgetting in answer set programming. (English)
Artif. Intell. 172, No. 14, 1644-1672 (2008).
12
On propositional definability. (English)
Artif. Intell. 172, No. 8-9, 991-1017 (2008).
13
Expressive probabilistic description logics. (English)
Artif. Intell. 172, No. 6-7, 852-883 (2008).
14
Termination of derivations in a fragment of transitive distributed knowledge logic. (English)
Informatica, Vilnius 19, No. 4, 597-616 (2008).
15
Interactive and noninteractive zero knowledge are equivalent in the help model. (English)
Canetti, Ran (ed.), Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19‒21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78524-8/pbk). Lecture Notes in Computer Science 4948, 501-534 (2008).
16
Complexity of finite-variable fragments of EXPTIME-complete logics. (English)
J. Appl. Non-Class. Log. 17, No. 3, 359-382 (2007).
17
Zero-knowledge from secure multiparty computation. (English)
STOC’07. Proceedings of the 39th annual ACM symposium on theory of computing, San Diego, CA, USA, June 11‒13, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-631-8). 21-30 (2007).
18
Probabilistic proof systems: a primer. (English)
Found. Trends Theor. Comput. Sci. 3, No. 1, 1-91 (2007).
19
Efficient and scalable algorithms for inferring likely invariants in distributed systems. (English)
IEEE Trans. Knowl. Data Eng. 19, No. 11, 1508-1523 (2007).
20
Result 1 to 20 of 127 total
Start
Contact
Print
General Help
