Result 1 to 20 of 576 total
The scientific contribution of Marek Sergot. (English)
Artikis, Alexander (ed.) et al., Logic programs, norms and action. Essays in honor of Marek J. Sergot on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-29413-6/pbk). Lecture Notes in Computer Science 7360. Lecture Notes in Artificial Intelligence, 4-11 (2012).
1
Selecting against antibiotic-resistant pathogens: optimal treatments in the presence of commensal bacteria. (English)
Bull. Math. Biol. 74, No. 4, 908-934 (2012).
2
An introduction to computable model theory on groups and fields. (English)
Groups Complex. Cryptol. 3, No. 1, 25-45 (2011).
3
Cryptography secure against related-key attacks and tampering. (English)
Lee, Dong Hoon (ed.) et al., Advances in cryptology ‒ ASIACRYPT 2011. 17th international conference on the theory and application of cryptology and information security, Seoul, South Korea, December 4‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25384-3/pbk). Lecture Notes in Computer Science 7073, 486-503 (2011).
4
Low$_{5}$ Boolean subalgebras and computable copies. (English)
J. Symb. Log. 76, No. 3, 1061-1074 (2011).
5
Adapting Rabin’s theorem for differential fields. (English)
Löwe, Benedikt (ed.) et al., Models of computation in context. 7th conference on computability in Europe, CiE 2011, Sofia, Bulgaria, June 27‒July 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21874-3/pbk). Lecture Notes in Computer Science 6735, 211-220 (2011).
6
SERVQUAL dimensionality: an investigation of presentation order effect. (English)
Int. J. Serv. Stand. 7, No. 1, 1-17 (2011).
7
Noncomputable functions in the blum-shub-Smale model. (English)
Comput. Res. Repos. 2011, Article No. 1105.1380 (2011).
8
A potential causal association mining algorithm for screening adverse drug reactions in postmarketing surveillance. (English)
IEEE Trans. Inf. Technol. Biomed. 15, No. 3, 428-437 (2011).
9
$\cal M$odular-$\cal E$ and the role of elaboration tolerance in solving the qualification problem. (English)
Artif. Intell. 175, No. 1, 49-78 (2011).
10
Noncomputable functions in the Blum-Shub-Smale model. (English)
Log. Methods Comput. Sci. 7, No. 2, Paper No. 15, 20 p., electronic only (2011).
11
Computability of Fraïssé limits. (English)
J. Symb. Log. 76, No. 1, 66-93 (2011).
12
Code completion of multiple keywords from abbreviated input (English)
Autom. Softw. Eng. 18, No. 3-4, 363-398 (2011).
13
$Low_{5}$ Boolean subalgebras and computable copies (English)
J. Symb. Log. 76, No. 3, 1061-1074 (2011).
14
Computability of fraïssé limits (English)
J. Symb. Log. 76, No. 1, 66-93 (2011).
15
Cryptography secure against related-key attacks and tampering (English)
IACR Cryptology ePrint Archive 2011, 252 (2011).
16
Debugging data exchange with vagabond (English)
PVLDB 4, No. 12, 1383-1386 (2011).
17
Human-powered sorts and joins (English)
PVLDB 5, No. 1, 13-24 (2011).
18
A distortion-sensitive seam carving algorithm for content-aware image resizing (English)
Signal Processing Systems 65, No. 2, 159-169 (2011).
19
Evaluating the utility of syndromic surveillance algorithms for screening to detect potentially clonal hospital infection outbreaks (English)
JAMIA 18, No. 4, 466-472 (2011).
20
Result 1 to 20 of 576 total
Start
Contact
Print
General Help
