BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Poland
1 × The Netherlands
1 × USA
Collaborated with:
U.M.Maurer R.Cramer I.Damgård M.Jurdzinski I.Walukiewicz
Talks about:
bound (2) multiparti (1) fixpoint (1) variabl (1) infinit (1) complex (1) complet (1) verifi (1) storag (1) secret (1)

Person: Stefan Dziembowski

DBLP DBLP: Dziembowski:Stefan

Contributed to:

STOC 20022002
STOC 20002000
LICS 19971997
CSL 19961996

Wrote 4 papers:

STOC-2002-DziembowskiM #bound #proving #security
Tight security proofs for the bounded-storage model (SD, UMM), pp. 341–350.
STOC-2000-CramerDD #complexity #multi #on the
On the complexity of verifiable secret sharing and multiparty computation (RC, ID, SD), pp. 325–334.
LICS-1997-DziembowskiJW #game studies #how #infinity #memory management #question
How Much Memory is Needed to Win Infinite Games? (SD, MJ, IW), pp. 99–110.
CSL-1996-Dziembowski #bound #fixpoint #query
Bounded-Variable Fixpoint Queries are PSPACE-complete (SD), pp. 89–105.

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.