default search action
Lisbeth Fajstrup
Person information
- affiliation: Aalborg University, Department of Mathematical Sciences, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j8]Lisbeth Fajstrup
:
Cut-off theorems for the PV-model. Formal Methods Syst. Des. 59(1): 21-43 (2021) - [i5]Robin Belton, Robyn Brooks, Stefania Ebli, Lisbeth Fajstrup, Brittany Terese Fasy, Nicole Sanderson, Elizabeth Vidaurre:
Combinatorial Conditions for Directed Collapsing. CoRR abs/2106.01524 (2021)
2010 – 2019
- 2018
- [i4]Lisbeth Fajstrup:
Cut-off Theorems for the PV-model. CoRR abs/1807.03144 (2018) - 2017
- [j7]Lisbeth Fajstrup
On the Hierarchy of d-structures. Order 34(1): 139-163 (2017) - 2016
- [b1]Lisbeth Fajstrup
Directed Algebraic Topology and Concurrency. Springer 2016, ISBN 978-3-319-15397-1, pp. 1-167 - 2014
- [j6]Lisbeth Fajstrup
Trace spaces of directed tori with rectangular holes. Math. Struct. Comput. Sci. 24(2) (2014) - 2012
- [c4]Lisbeth Fajstrup
Trace Spaces: An Efficient New Technique for State-Space Reduction. ESOP 2012: 274-294 - [e3]Lisbeth Fajstrup, Eric Goubault, Martin Raussen:
Proceedings of the workshop on Geometric and Topological Methods in Computer Science, GETCO 2010, Aalborg, Denmark, January 11-15, 2010. Electronic Notes in Theoretical Computer Science 283, Elsevier 2012 [contents] - [i3]Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt, Samuel Mimram, Martin Raussen:
Trace Spaces: an Efficient New Technique for State-Space Reduction. CoRR abs/1204.0414 (2012) - [i2]Lisbeth Fajstrup, Dmitry Feichtner-Kozlov, Maurice Herlihy:
Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121). Dagstuhl Reports 2(3): 50-66 (2012) - 2010
- [c3]Lisbeth Fajstrup
Preface. GETCO 2010: 1-2
2000 – 2009
- 2006
- [j5]Lisbeth Fajstrup
Algebraic topology and concurrency. Theor. Comput. Sci. 357(1-3): 241-278 (2006) - [j4]Lisbeth Fajstrup
Cubical local partial orders on cubically subdivided spaces - Existence and construction. Theor. Comput. Sci. 365(3): 199-205 (2006) - 2005
- [j3]Lisbeth Fajstrup
Dipaths and dihomotopies in a cubical complex. Adv. Appl. Math. 35(2): 188-206 (2005) - [i1]Lisbeth Fajstrup:
Dihomotopy Classes of Dipaths in the Geometric Realization of a Cubical Set: from Discrete to Continuous and back again. Spatial Representation 2005 - 2004
- [j2]Lisbeth Fajstrup
Components of the Fundamental Category. Appl. Categorical Struct. 12(1): 81-108 (2004) - 2003
- [e2]Patrick Cousot, Lisbeth Fajstrup, Eric Goubault, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
4th Workshop on GEometry and Topology in COncurrency and distributed systems theory, GETCO 2002, Satellite workshop of DISC 2002, Toulouse, France, October 2002. Electronic Notes in Theoretical Computer Science 81, Elsevier 2003 [contents] - 2002
- [e1]Patrick Cousot, Lisbeth Fajstrup, Eric Goubault, Jeremy Gunawardena, Maurice Herlihy, Martin Raussen, Vladimiro Sassone:
3rd Workshop on GEometry and Topology in COncurrency theory, GETCO 2001, Satellite Event of CONCUR 2001, Aalborg, Denmark, August 25, 2001. Electronic Notes in Theoretical Computer Science 52(2), Elsevier 2002 [contents] - 2000
- [j1]Lisbeth Fajstrup:
Loops, ditopology and deadlocks. Math. Struct. Comput. Sci. 10(4): 459-480 (2000) - [c2]Lisbeth Fajstrup, Stefan Sokolowski:
Infinitely Running Concurrent Processes with Loops from a Geometric Viewpoint. GETCO 2000: 1-19
1990 – 1999
- 1998
- [c1]Lisbeth Fajstrup, Eric Goubault, Martin Raußen:
Detecting Deadlocks in Concurrent Systems. CONCUR 1998: 332-347
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-25 05:56 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: