default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Haas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Sándor P. Fekete
, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt:
Computing Area-Optimal Simple Polygonizations. ACM J. Exp. Algorithmics 27: 2.6:1-2.6:23 (2022)- [c15]Mohit Kumar, Andreas Haas, Peter Strauss, Sven Kraus, Ömer Sahin Tas, Christoph Stiller:
Conception and Experimental Validation of a Model Predictive Control (MPC) for Lateral Control of a Truck-Trailer. IV 2022: 1550-1557 - 2021
- [i4]Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt:
Computing Area-Optimal Simple Polygonizations. CoRR abs/2111.05386 (2021)
2010 – 2019
- 2019
- [c14]Dominik Krupke, Volker Schaus, Andreas Haas, Michael Perk, Jonas Dippel, Benjamin Grzesik, Mohamed Khalil Ben Larbi, Enrico Stoll, Tom Haylock, Harald Konstanski, Kattia Flores Pozo, Mirue Choi, Christian Schurig, Sándor P. Fekete:
Automated Data Retrieval from Large-Scale Distributed Satellite Systems. CASE 2019: 1789-1795 - 2018
- [j3]Andreas Rossberg, Ben L. Titzer, Andreas Haas, Derek L. Schuff, Dan Gohman, Luke Wagner, Alon Zakai, J. F. Bastien, Michael Holman:
Bringing the web up to speed with WebAssembly. Commun. ACM 61(12): 107-115 (2018) - [c13]Andreas Haas:
Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality. SoCG 2018: 44:1-44:14 - [c12]Julian Ludwig, Andreas Haas, Michael Flad, Sören Hohmann:
A Comparison of Concepts for Control Transitions from Automation to Human. SMC 2018: 3201-3206 - [i3]Andreas Haas:
Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality. CoRR abs/1802.06415 (2018) - 2017
- [j2]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing nonsimple polygons of minimum perimeter. J. Comput. Geom. 8(1): 340-365 (2017) - [c11]Andreas Haas, Andreas Rossberg, Derek L. Schuff, Ben L. Titzer, Michael Holman, Dan Gohman, Luke Wagner, Alon Zakai, J. F. Bastien:
Bringing the web up to speed with WebAssembly. PLDI 2017: 185-200 - 2016
- [c10]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 - [c9]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. SEA 2016: 134-149 - [i2]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. CoRR abs/1603.07077 (2016) - 2015
- [c8]Andreas Haas, Thomas Hütter, Christoph M. Kirsch, Michael Lippautz, Mario Preishuber, Ana Sokolova:
Scal: A Benchmarking Suite for Concurrent Data Structures. NETYS 2015: 1-14 - [c7]Mike Dodds, Andreas Haas, Christoph M. Kirsch:
A Scalable, Correct Time-Stamped Stack. POPL 2015: 233-246 - [i1]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) - 2013
- [c6]Andreas Haas, Michael Lippautz, Thomas A. Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, Ali Sezgin:
Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. Conf. Computing Frontiers 2013: 17:1-17:9 - 2012
- [c5]Andreas Haas, Christoph M. Kirsch, Michael Lippautz, Hannes Payer:
How FIFO is your concurrent FIFO queue? RACES@SPLASH 2012: 1-8 - 2011
- [c4]Martin Aigner, Andreas Haas, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova, Stephanie Stroka, Andreas Unterweger:
Short-term memory for self-collecting mutators. ISMM 2011: 99-108 - 2010
- [c3]Silviu S. Craciunas, Andreas Haas, Christoph M. Kirsch, Hannes Payer, Harald Röck, Andreas Rottmann, Ana Sokolova, Rainer Trummer, Joshua Love, Raja Sengupta:
Information-Acquisition-as-a-Service for Cyber-Physical Cloud Computing. HotCloud 2010
2000 – 2009
- 2009
- [j1]Peter Tröger, Hrabri Rajic, Andreas Haas, Piotr Domagalski:
Standardised job submission and control in cluster and grid environments. Int. J. Grid Util. Comput. 1(2): 134-145 (2009) - 2007
- [c2]Peter Tröger, Hrabri Rajic, Andreas Haas, Piotr Domagalski:
Standardization of an API for Distributed Resource Management Systems. CCGRID 2007: 619-626
1990 – 1999
- 1998
- [c1]Peter Luksch, Ursula Maier, Sabine Rathmayer, Matthias Weidmann, Friedemann Unger, Peter Bastian, Volker Reichenberger, Andreas Haas:
Software Engineering in Parallel and Distributed Scientific Computing: A Case Study from Industrial Practice. PDSE 1998: 187-197
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:50 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:
