default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJochen Burghardt
Person information
- affiliation: Technical University of Berlin, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i13]Jochen Burghardt:
An Algebra of Properties of Binary Relations. CoRR abs/2102.05616 (2021)
2010 – 2019
- 2018
- [i12]Jochen Burghardt:
A Scheme-Driven Approach to Learning Programs from Input/Output Equations. CoRR abs/1802.01177 (2018) - 2017
- [i11]Jochen Burghardt:
An Improved Algorithm for E-Generalization. CoRR abs/1709.00744 (2017) - 2016
- [i10]Jochen Burghardt:
Repetition-Free Derivability from a Regular Grammar is NP-Hard. CoRR abs/1602.05555 (2016) - [i9]Jochen Burghardt:
Weight Computation of Regular Tree Languages. CoRR abs/1603.02928 (2016) - 2014
- [i8]Jochen Burghardt:
Maintaining partial sums in logarithmic time. CoRR abs/1401.0921 (2014) - [i7]Jochen Burghardt:
Axiomatization of Finite Algebras. CoRR abs/1403.7347 (2014) - [i6]Jochen Burghardt:
E-Generalization Using Grammars. CoRR abs/1403.8118 (2014) - [i5]Jochen Burghardt, Birgit Heinz:
Implementing Anti-Unification Modulo Equational Theory. CoRR abs/1404.0953 (2014) - [i4]Jochen Burghardt:
Experiences in Developing Time-Critical Systems - The Case Study "Production Cell". CoRR abs/1404.1198 (2014) - [i3]Jochen Burghardt:
Regular Substitution Sets: A Means of Controlling E-Unification. CoRR abs/1404.1201 (2014) - [i2]Jochen Burghardt:
Formale Entwicklung einer Steuerung für eine Fertigungszelle mit SYSYFOS. CoRR abs/1404.1227 (2014) - [i1]Jochen Burghardt:
Eine entscheidbare Klasse n-stelliger Horn-Prädikate. CoRR abs/1404.1947 (2014) - 2013
- [c4]Virgile Prevosto
, Jochen Burghardt, Jens Gerlach, Kerstin Hartig, Hans Werner Pohl, Kim Völlinger:
Formal specification and automated verification of railway software with Frama-C. INDIN 2013: 710-715
2000 – 2009
- 2005
- [j3]Jochen Burghardt:
E-generalization using grammars. Artif. Intell. 165(1): 1-35 (2005) - 2002
- [c3]Jochen Burghardt:
Axiomatization of Finite Algebras. KI 2002: 222-234 - 2001
- [j2]Jochen Burghardt, Florian Kammüller, Jeff W. Sanders:
On the antisymmetry of Galois embeddings. Inf. Process. Lett. 79(2): 57-63 (2001) - [j1]Jochen Burghardt:
Maintaining Partial Sums in Logarithmic Time. Nord. J. Comput. 8(4): 473-474 (2001)
1990 – 1999
- 1995
- [c2]Jochen Burghardt:
Regular Substitution Sets: A Means of Controlling E-Unification. RTA 1995: 382-396 - [p2]Jochen Burghardt:
A Fine-Grain Sort Discipline and Its Application to Formal Program Construction. KORSO Book 1995: 190-204 - [p1]Jochen Burghardt:
Deductive Synthesis. Formal Development of Reactive Systems 1995: 295-309 - 1993
- [b1]Jochen Burghardt:
Eine feinkörnige Sortendisziplin und ihre Anwendung in der Programmkonstruktion. Karlsruhe Institute of Technology, Germany, Oldenbourg 1993, ISBN 978-3-486-22687-4, pp. 1-246
1980 – 1989
- 1988
- [c1]Jochen Burghardt:
A Tree Pattern Matching Algorithm with Reasonable Space Requirements. CAAP 1988: 1-15
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 2025-01-09 12:52 CET 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:
