default search action
Aleksandar Prokopec
Person information
- affiliation: Oracle Labs, Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c28]Florian Huemer, David Leopoldseder, Aleksandar Prokopec, Raphael Mosaner, Hanspeter Mössenböck:
Taking a Closer Look: An Outlier-Driven Approach to Compilation-Time Optimization. ECOOP 2024: 20:1-20:28 - 2023
- [j3]Matt D'Souza
, James You
TASTyTruffle: Just-in-Time Specialization of Parametric Polymorphism. Proc. ACM Program. Lang. 7(OOPSLA2): 1561-1588 (2023) - [j2]Matteo Basso
Optimization-Aware Compiler-Level Event Profiling. ACM Trans. Program. Lang. Syst. 45(2): 10:1-10:50 (2023) - [j1]Maja Vukasovic
Exploiting Partially Context-sensitive Profiles to Improve Performance of Hot Code. ACM Trans. Program. Lang. Syst. 45(4): 20:1-20:64 (2023) - [c27]Lubomír Bulej
GraalVM Compiler Benchmark Results Dataset (Data Artifact). ICPE (Companion) 2023: 65-69 - 2022
- [c26]Fengyun Liu, Aleksandar Prokopec
Implicit state machines. LCTES 2022: 13-25 - [c25]Matthew Edwin Weingarten, Theodoros Theodoridis, Aleksandar Prokopec
Inlining-Benefit Prediction with Interprocedural Partial Escape Analysis. VMIL@SPLASH 2022: 13-24 - [e1]Christos Kotselidis, Aleksandar Prokopec:
Proceedings of the 14th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages, VMIL 2022, Auckland, New Zealand, 5 December 2022. ACM 2022, ISBN 978-1-4503-9912-8 [contents] - 2020
- [c24]Trevor Brown, Aleksandar Prokopec, Dan Alistarh:
Non-blocking interpolation search trees with doubly-logarithmic running time. PPoPP 2020: 276-291 - [c23]Aleksandar Prokopec, Andrea Rosà, David Leopoldseder, Gilles Duboscq, Petr Tuma, Martin Studener, Lubomír Bulej, Yudi Zheng, Alex Villazón, Doug Simon, Thomas Würthinger, Walter Binder
Renaissance: Benchmarking Suite for Parallel Applications on the JVM. SE 2020: 145-146 - [c22]Lubomír Bulej
Duet Benchmarking: Improving Measurement Accuracy in the Cloud. ICPE 2020: 100-107 - [i6]Aleksandar Prokopec
Analysis and Evaluation of Non-Blocking Interpolation Search Trees. CoRR abs/2001.00413 (2020) - [i5]Lubomír Bulej, Vojtech Horký, Petr Tuma, François Farquet, Aleksandar Prokopec
Duet Benchmarking: Improving Measurement Accuracy in the Cloud. CoRR abs/2001.05811 (2020)
2010 – 2019
- 2019
- [c21]Aleksandar Prokopec, Gilles Duboscq, David Leopoldseder, Thomas Würthinger:
An Optimization-Driven Incremental Inline Substitution Algorithm for Just-in-Time Compilers. CGO 2019: 164-179 - [c20]Aleksandar Prokopec
Renaissance: a modern benchmark suite for parallel applications on the JVM. SPLASH (Companion Volume) 2019: 11-12 - [c19]Aleksandar Prokopec
Renaissance: benchmarking suite for parallel applications on the JVM. PLDI 2019: 31-47 - [i4]Aleksandar Prokopec, Andrea Rosà, David Leopoldseder, Gilles Duboscq, Petr Tuma, Martin Studener, Lubomír Bulej, Yudi Zheng, Alex Villazón, Doug Simon, Thomas Würthinger, Walter Binder:
On Evaluating the Renaissance Benchmarking Suite: Variety, Performance, and Complexity. CoRR abs/1903.10267 (2019) - 2018
- [c18]Aleksandar Prokopec
Theory and Practice of Coroutines with Snapshots. ECOOP 2018: 3:1-3:32 - [c17]Aleksandar Prokopec:
Efficient Lock-Free Removing and Compaction for the Cache-Trie Data Structure. Euro-Par 2018: 575-589 - [c16]Aleksandar Prokopec
Cache-tries: concurrent lock-free hash tries with constant-time operations. PPoPP 2018: 137-151 - [p1]Aleksandar Prokopec
Pluggable Scheduling for the Reactor Programming Model. Programming with Actors 2018: 125-154 - [i3]Aleksandar Prokopec
On the Soundness of Coroutines with Snapshots. CoRR abs/1806.01405 (2018) - 2017
- [c15]Aleksandar Prokopec
Accelerating by Idling: How Speculative Delays Improve Performance of Message-Oriented Systems. Euro-Par 2017: 177-191 - [c14]Aleksandar Prokopec
Encoding the building blocks of communication. Onward! 2017: 104-118 - [c13]Aleksandar Prokopec
Making collection operations optimal with aggressive JIT compilation. SCALA@SPLASH 2017: 29-40 - [i2]Aleksandar Prokopec, Phil Bagwell, Martin Odersky:
Cache-Aware Lock-Free Concurrent Hash Tries. CoRR abs/1709.06056 (2017) - [i1]Aleksandar Prokopec
Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations. CoRR abs/1712.09636 (2017) - 2016
- [c12]Aleksandar Prokopec
Pluggable scheduling for the reactor programming model. AGERE!@SPLASH 2016: 41-50 - 2015
- [c11]Aleksandar Prokopec
Conc-Trees for Functional and Parallel Programming. LCPC 2015: 254-268 - [c10]Aleksandar Prokopec
Isolates, channels, and event streams for composable distributed programming. Onward! 2015: 171-182 - [c9]Aleksandar Prokopec
Efficient Lock-Free Work-Stealing Iterators for Data-Parallel Collections. PDP 2015: 248-252 - [c8]Aleksandar Prokopec
SnapQueue: lock-free queue with constant time snapshots. Scala@PLDI 2015: 1-12 - 2014
- [b1]Aleksandar Prokopec:
Data Structures and Algorithms for Data-Parallel Computing in a Managed Runtime. EPFL, Switzerland, 2014 - [c7]Aleksandar Prokopec
Containers and aggregates, mutators and isolates for reactive programming. SCALA@ECOOP 2014: 51-61 - 2013
- [c6]Arvind K. Sujeeth, Tiark Rompf, Kevin J. Brown, HyoukJoong Lee, Hassan Chafi, Victoria Popic, Michael Wu, Aleksandar Prokopec
Composition and Reuse with Compiled Domain-Specific Languages. ECOOP 2013: 52-78 - [c5]Aleksandar Prokopec
Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads. LCPC 2013: 55-86 - 2012
- [c4]Aleksandar Prokopec
FlowPools: A Lock-Free Deterministic Concurrent Dataflow Abstraction. LCPC 2012: 158-173 - [c3]Aleksandar Prokopec
Concurrent tries with efficient non-blocking snapshots. PPoPP 2012: 151-160 - 2011
- [c2]Aleksandar Prokopec
A Generic Parallel Collection Framework. Euro-Par (2) 2011: 136-147 - [c1]Aleksandar Prokopec
Lock-Free Resizeable Concurrent Tries. LCPC 2011: 156-170
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-09-14 01:12 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: