BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Czech Republic
1 × USA
2 × Germany
2 × United Kingdom
Collaborated with:
Y.Gurevich ∅ N.Dershowitz L.Nachmanson M.Veanes
Talks about:
choiceless (1) background (1) necessari (1) algorithm (1) polynomi (1) complex (1) theori (1) semant (1) reserv (1) reduct (1)

Person: Andreas Blass

DBLP DBLP: Blass:Andreas

Contributed to:

CSL 20102010
LICS 20062006
FATES 20052005
CSL 20002000
CSL 19931993
CSL 19901990

Wrote 7 papers:

CSL-2010-BlassDG #algorithm
Exact Exploration and Hanging Algorithms (AB, ND, YG), pp. 140–154.
LICS-2006-Blass #adaptation #logic
Adapting Logics (AB), p. 123.
FATES-2005-BlassGNV #game studies
Play to Test (AB, YG, LN, MV), pp. 32–46.
CSL-2000-BlassG
Background, Reserve, and Gandy Machines (AB, YG), pp. 1–17.
CSL-2000-BlassG00a #polynomial
Choiceless Polynomial Time Computation and the Zero-One Law (AB, YG), pp. 18–40.
CSL-1993-Blass #game studies #question #semantics
Is Game Semantics Necessary? (AB), pp. 66–77.
CSL-1990-BlassG #complexity #on the #reduction
On the Reduction Theory for Average Case Complexity (AB, YG), pp. 17–30.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.