default search action
Michael Lippautz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [e1]Michael Lippautz, David Chisnall:
ISMM '22: ACM SIGPLAN International Symposium on Memory Management, San Diego, CA, USA, 14 June 2022. ACM 2022, ISBN 978-1-4503-9267-9 [contents]
2010 – 2019
- 2019
- [j4]Ulan Degenbaev, Michael Lippautz, Hannes Payer:
Garbage collection as a joint venture. Commun. ACM 62(6): 36-41 (2019) - [j3]Ulan Degenbaev, Michael Lippautz, Hannes Payer:
Garbage Collection as a Joint Venture. ACM Queue 17(1): 60 (2019) - [c10]Ulan Degenbaev, Michael Lippautz, Hannes Payer:
Concurrent marking of shape-changing objects. ISMM 2019: 89-102 - 2018
- [j2]Ulan Degenbaev, Jochen Eisinger, Kentaro Hara, Marcel Hlopko, Michael Lippautz, Hannes Payer:
Cross-component garbage collection. Proc. ACM Program. Lang. 2(OOPSLA): 151:1-151:24 (2018) - 2016
- [c9]Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova
, Helmut Veith:
Local Linearizability for Concurrent Container-Type Data Structures. CONCUR 2016: 6:1-6:15 - 2015
- [c8]Andreas Haas, Thomas Hütter
Scal: A Benchmarking Suite for Concurrent Data Structures. NETYS 2015: 1-14 - [c7]Martin Aigner, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova
Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures. OOPSLA 2015: 451-469 - [i2]Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, Helmut Veith:
Local Linearizability. CoRR abs/1502.07118 (2015) - [i1]Martin Aigner, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova:
Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through Large Virtual Memory and Global Data Structures. CoRR abs/1503.09006 (2015) - 2013
- [c6]Andreas Haas, Michael Lippautz, Thomas A. Henzinger, Hannes Payer, Ana Sokolova
Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. Conf. Computing Frontiers 2013: 17:1-17:9 - [c5]Christoph M. Kirsch, Michael Lippautz, Hannes Payer:
Fast and Scalable, Lock-Free k-FIFO Queues. PaCT 2013: 208-223 - 2012
- [c4]Christoph M. Kirsch, Eloi Pereira, Raja Sengupta, Hao Chen, Robert Hansen, Jiangchuan Huang, Florian Landolt, Michael Lippautz, Andreas Rottmann, Ryan Swick, Rainer Trummer, D. Vizzini:
Cyber-physical cloud computing: The binding and migration problem. DATE 2012: 1425-1428 - [c3]Andreas Haas, Christoph M. Kirsch, Michael Lippautz, Hannes Payer:
How FIFO is your concurrent FIFO queue? RACES@SPLASH 2012: 1-8 - 2011
- [c2]Günther Sagl, Michael Lippautz, Manfred Mittlböck, Bernd Resch, Thomas Blaschke:
Web-Based Near Real-Time Geo-Analyses of Environmental Sensor Measurements. Geoinformatik 2011: 139-142 - [c1]Martin Aigner, Andreas Haas, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova
Short-term memory for self-collecting mutators. ISMM 2011: 99-108 - 2010
- [j1]Bernd Resch
Pervasive Monitoring - An Intelligent Sensor Pod Approach for Standardised Measurement Infrastructures. Sensors 10(12): 11440-11467 (2010)
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 22:59 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: