default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKurt Sieber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j5]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. Theory Comput. Syst. 64(1): 141-176 (2020)- [c7]Carl Philipp Reh, Kurt Sieber:
Navigating Forest Straight-Line Programs in Constant Time. SPIRE 2020: 11-26
2010 – 2019
- 2019
- [j4]Markus Lohrey, Carl Philipp Reh, Kurt Sieber:
Size-optimal top dag compression. Inf. Process. Lett. 147: 27-31 (2019) - 2018
- [c6]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. CSR 2018: 118-131 - [i2]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-based Compression of Unranked Trees. CoRR abs/1802.05490 (2018) - 2017
- [i1]Markus Lohrey, Carl Philipp Reh, Kurt Sieber:
Optimal top dag compression. CoRR abs/1712.05822 (2017) - 2010
- [j3]Kurt Sieber:
Preface. J. Log. Algebraic Methods Program. 79(1): 1 (2010)
1990 – 1999
- 1996
- [j2]Kurt Sieber:
Full Abstraction for the Second Order Subset of an Algol-Like Language. Theor. Comput. Sci. 168(1): 155-212 (1996) - 1994
- [j1]Gudula Rünger, Kurt Sieber:
A Process Oriented Semantics of the PRAM-Language FORK. Comput. Lang. 20(4): 253-265 (1994) - [c5]Kurt Sieber:
Full Abstraction for the Second Order Subset of an Algol-Like Language. MFCS 1994: 608-617 - 1993
- [c4]Kurt Sieber:
Call-by-Value and Nondeterminism. TLCA 1993: 376-390 - 1990
- [c3]Kurt Sieber:
Relating Full Abstraction Results for Different Programming Languages. FSTTCS 1990: 373-387
1980 – 1989
- 1988
- [c2]Albert R. Meyer, Kurt Sieber:
Towards Fully Abstract Semantics for Local Variables. POPL 1988: 191-203 - 1987
- [b3]Jacques Loeckx, Kurt Sieber:
The Foundations of Program Verification, 2nd ed. Wiley-Teubner 1987, ISBN 3-519-12101-8 - 1984
- [b2]Jacques Loeckx, Kurt Sieber:
The Foundations of Program Verification, 1st ed. Wiley-Teubner 1984, ISBN 3-519-02101-3 - [b1]Kurt Sieber:
Die "Modale Logik der Prozeduren": e. Erweiterung der Hoare-Logik, die es ermöglicht, Korrektheitsbeweise im Sinne des "stepwise refinement" zu führen. Saarland University, Saarbrücken, Germany, 1984, pp. 1-173 - 1983
- [c1]Kurt Sieber:
Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi. Theoretical Computer Science 1983: 325-334
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
