Result 1 to 20 of 158 total
Partitions and permutation groups. (English)
Grohe, Martin (ed.) et al., Model theoretic methods in finite combinatorics. AMS-ASL joint special session, Washington, DC, USA, January 5‒8, 2009. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4943-9/pbk). Contemporary Mathematics 558, 453-466 (2011).
1
Persistent queries in the behavioral theory of algorithms (English)
ACM Trans. Comput. Log. 12, No. 2, 16 (2011).
2
Ultrafilters across mathematics. International congress ULTRAMATH 2008: Applications of ultrafilters and ultraproducts in mathematics, Pisa, Italy, June 1‒7, 2008. (English)
Contemporary Mathematics 530. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4833-3/pbk). ix, 200~p. \$~69.00 (2010).
3
The tower-of-Babel problem, and security assessment sharing. (English)
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 101, 161-182 (2010).
4
Exact exploration and hanging algorithms. (English)
Dawar, Anuj (ed.) et al., Computer science logic. 24th international workshop, CSL 2010, 19th annual conference of the EACSL, Brno, Czech Republic, August 23‒27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15204-7/pbk). Lecture Notes in Computer Science 6247, 140-154 (2010).
5
Existential fixed-point logic, universal quantifiers, and topoi. (English)
Blass, Andreas (ed.) et al., Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). Lecture Notes in Computer Science 6300, 108-134 (2010).
6
Yuri, logic, and computer science. (English)
Blass, Andreas (ed.) et al., Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). Lecture Notes in Computer Science 6300, 1-48 (2010).
7
Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. (English)
Lecture Notes in Computer Science 6300. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). xiii, 627~p. EUR~84.53 (2010).
8
Content-dependent chunking for differential compression, the local maximum approach. (English)
J. Comput. Syst. Sci. 76, No. 3-4, 154-203 (2010).
9
Existential fixed-point logic, universal quantifiers, and topoi (English)
Fields of Logic and Computation, 108-134 (2010).
10
Evidential authorization (English)
The Future of Software Engineering, 73-99 (2010).
11
Yuri, logic, and computer science (English)
Fields of Logic and Computation, 1-48 (2010).
12
Exact exploration and hanging algorithms (English)
CSL, 140-154 (2010).
13
When are two algorithms the same? (English)
Bull. Symb. Log. 15, No. 2, 145-168 (2009).
14
When are two algorithms the same? (English)
Bulletin of Symbolic Logic 15, No. 2, 145-168 (2009).
15
Two forms of one useful logic: Existential fixed point logic and liberal Datalog. (English)
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 95, 164-182 (2008).
16
Modular difference logic is hard. (English)
Comput. Res. Repos. 2008, Article No. 0811.0987 (2008).
17
Two forms of one useful logic: Existential fixed point logic and liberal Datalog. (English)
Comput. Res. Repos. 2008, Article No. 0811.0977 (2008).
18
One useful logic that defines its own truth. (English)
Comput. Res. Repos. 2008, Article No. 0811.0964 (2008).
19
Persistent queries. (English)
Comput. Res. Repos. 2008, Article No. 0811.0819 (2008).
20
Result 1 to 20 of 158 total
Start
Contact
Print
General Help
