default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCosmin E. Oancea
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Cosmin E. Oancea, Stephen M. Watt:
GPU Implementations for Midsize Integer Addition and Multiplication. CoRR abs/2405.14642 (2024)- 2023
- [c34]Dmitry Serykh
, Stefan Oehmcke, Cosmin E. Oancea, Dainius Masiliunas, Jan Verbesselt, Yan Cheng, Stéphanie Horion, Fabian Gieseke, Nikolaj Hinnerskov:
Seasonal-Trend Time Series Decomposition on Graphics Processing Units. IEEE Big Data 2023: 5914-5923 - [c33]Lotte Maria Bruun, Ulrik Stuhr Larsen, Nikolaj Hey Hinnerskov, Cosmin Eugen Oancea:
Reverse-Mode AD of Multi-Reduce and Scan in Futhark. IFL 2023: 14:1-14:14 - [i3]Lotte Maria Bruun, Ulrik Stuhr Larsen, Nikolaj Hinnerskov, Cosmin E. Oancea:
Reverse-Mode AD of Reduce-by-Index and Scan in Futhark. CoRR abs/2310.03568 (2023) - 2022
- [c32]Philip Munksgaard, Cosmin E. Oancea, Troels Henriksen:
Compiling a functional array language with non-semantic memory information. IFL 2022: 2:1-2:13 - [c31]Philip Munksgaard, Troels Henriksen, Ponnuswamy Sadayappan, Cosmin E. Oancea:
Memory Optimizations in an Array Language. SC 2022: 31:1-31:15 - [c30]Robert Schenck, Ola Rønning, Troels Henriksen, Cosmin E. Oancea:
AD for an Array Language with Nested Parallelism. SC 2022: 58:1-58:15 - [d4]Philip Munksgaard, Troels Henriksen, Ponnuswamy Sadayappan, Cosmin E. Oancea:
futhark-mem-sc22. Version v0.1.8. Zenodo, 2022 [all versions]
- [d3]Philip Munksgaard, Troels Henriksen, Ponnuswamy Sadayappan, Cosmin E. Oancea:
futhark-mem-sc22. Version v1.0.0. Zenodo, 2022 [all versions] - [d2]Philip Munksgaard, Troels Henriksen, Ponnuswamy Sadayappan, Cosmin E. Oancea:
futhark-mem-sc22. Version v1.1.0. Zenodo, 2022 [all versions] - [d1]Philip Munksgaard, Troels Henriksen, Ponnuswamy Sadayappan, Cosmin E. Oancea:
futhark-mem-sc22. Version v1.1.1. Zenodo, 2022 [all versions] - [i2]Robert Schenck, Ola Rønning, Troels Henriksen, Cosmin E. Oancea:
AD for an Array Language with Nested Parallelism. CoRR abs/2202.10297 (2022) - 2021
- [c29]Wojciech Michal Pawlak, Marek Hlava, Martin Metaksov, Cosmin Eugen Oancea:
Acceleration of lattice models for pricing portfolios of fixed-income derivatives. ARRAY@PLDI 2021: 27-38 - [c28]Philip Munksgaard, Svend Lund Breddam, Troels Henriksen, Fabian Gieseke, Cosmin E. Oancea:
Dataset Sensitive Autotuning of Multi-versioned Code Based on Monotonic Properties - Autotuning in Futhark. TFP 2021: 3-23 - 2020
- [c27]Cosmin Eugen Oancea, Ties Robroek, Fabian Gieseke:
Approximate Nearest-Neighbour Fields via Massively-Parallel Propagation-Assisted K-D Trees. IEEE BigData 2020: 5172-5181 - [c26]Fabian Gieseke, Sabina Rosca, Troels Henriksen, Jan Verbesselt, Cosmin E. Oancea:
Massively-Parallel Change Detection for Satellite Time Series Data with Missing Values. ICDE 2020: 385-396 - [c25]Troels Henriksen, Sune Hellfritzsch, Ponnuswamy Sadayappan, Cosmin E. Oancea:
Compiling generalized histograms for GPU. SC 2020: 97
2010 – 2019
- 2019
- [c24]Wojciech Michal Pawlak, Martin Elsman, Cosmin Eugen Oancea:
A functional approach to accelerating Monte Carlo based american option pricing. IFL 2019: 5:1-5:12 - [c23]Troels Henriksen, Frederik Thorøe, Martin Elsman, Cosmin E. Oancea:
Incremental flattening for nested data parallelism. PPoPP 2019: 53-67 - 2018
- [j4]Martin Elsman, Troels Henriksen, Danil Annenkov, Cosmin E. Oancea:
Static interpretation of higher-order modules in Futhark: functional GPU programming in the large. Proc. ACM Program. Lang. 2(ICFP): 97:1-97:30 (2018) - [c22]Troels Henriksen, Martin Elsman, Cosmin E. Oancea:
Modular acceleration: tricky cases of functional high-performance computing. FHPC@ICFP 2018: 10-21 - [c21]Fabian Gieseke, Cosmin Eugen Oancea, Ashish Mahabal, Christian Igel, Tom Heskes:
Bigger Buffer k-d Trees on Multi-Many-Core Systems. VECPAR 2018: 202-214 - 2017
- [j3]Fabian Gieseke, Cosmin E. Oancea, Christian Igel:
bufferkdtree: A Python library for massive nearest neighbor queries on multi-many-core devices. Knowl. Based Syst. 120: 1-3 (2017) - [c20]Troels Henriksen, Niels G. W. Serup, Martin Elsman, Fritz Henglein, Cosmin E. Oancea:
Futhark: purely functional GPU-programming with nested parallelism and in-place array updates. PLDI 2017: 556-571 - [e1]Phil Trinder, Cosmin E. Oancea:
Proceedings of the 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing, FHPC@ICFP 2017, Oxford, UK, September 7, 2017. ACM 2017, ISBN 978-1-4503-5181-2 [contents] - 2016
- [j2]Christian Andreetta, Vivien Bégot, Jost Berthold, Martin Elsman, Fritz Henglein, Troels Henriksen, Maj-Britt Nordfang, Cosmin E. Oancea:
FinPar: A Parallel Financial Benchmark. ACM Trans. Archit. Code Optim. 13(2): 18:1-18:27 (2016) - [c19]Troels Henriksen, Martin Dybdal, Henrik Urms, Anna Sofie Kiehn, Daniel Gavin, Hjalte Abelskov, Martin Elsman, Cosmin E. Oancea:
APL on GPUs: a TAIL from the past, scribbled in Futhark. FHPC@ICFP 2016: 38-43 - [c18]Troels Henriksen, Ken Friis Larsen, Cosmin E. Oancea:
Design and GPGPU performance of Futhark's redomap construct. ARRAY@PLDI 2016: 17-24 - 2015
- [c17]Cosmin E. Oancea, Lawrence Rauchwerger:
Scalable conditional induction variables (CIV) analysis. CGO 2015: 213-224 - [i1]Fabian Gieseke, Cosmin Eugen Oancea, Ashish Mahabal, Christian Igel, Tom Heskes:
Bigger Buffer k-d Trees on Multi-Many-Core Systems. CoRR abs/1512.02831 (2015) - 2014
- [c16]Fabian Gieseke, Kai Lars Polsterer, Cosmin Eugen Oancea, Christian Igel:
Speedy greedy feature selection: Better redshift estimation via massive parallelism. ESANN 2014 - [c15]Troels Henriksen, Martin Elsman, Cosmin E. Oancea:
Size slicing: a hybrid approach to size inference in futhark. FHPC@ICFP 2014: 31-42 - [c14]Fabian Gieseke, Justin Heinermann, Cosmin E. Oancea, Christian Igel:
Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs. ICML 2014: 172-180 - [c13]Troels Henriksen, Cosmin E. Oancea:
Bounds Checking: An Instance of Hybrid Analysis. ARRAY@PLDI 2014: 88-94 - 2013
- [c12]Troels Henriksen, Cosmin Eugen Oancea:
A T2 graph-reduction approach to fusion. FHPC@ICFP 2013: 47-58 - 2012
- [c11]Cosmin E. Oancea, Christian Andreetta, Jost Berthold, Alain Frisch, Fritz Henglein:
Financial software on GPUs: between Haskell and Fortran. FHPC@ICFP 2012: 61-72 - [c10]Cosmin E. Oancea, Lawrence Rauchwerger:
Logical inference techniques for loop parallelization. PLDI 2012: 509-520 - 2011
- [j1]Cosmin E. Oancea, Stephen M. Watt:
An architecture for generic extensions. Sci. Comput. Program. 76(4): 258-277 (2011) - [c9]Cosmin E. Oancea, Lawrence Rauchwerger:
A Hybrid Approach to Proving Memory Reference Monotonicity. LCPC 2011: 61-75
2000 – 2009
- 2009
- [c8]Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt:
A new approach to parallelising tracing algorithms. ISMM 2009: 10-19 - [c7]Cosmin E. Oancea, Alan Mycroft, Tim Harris:
A lightweight in-place implementation for software thread-level speculation. SPAA 2009: 223-232 - 2008
- [c6]Cosmin E. Oancea, Alan Mycroft:
Software thread-level speculation: an optimistic library implementation. IWMSE@ICSE 2008: 23-32 - [c5]Cosmin E. Oancea, Alan Mycroft:
Set-Congruence Dynamic Analysis for Thread-Level Speculation (TLS). LCPC 2008: 156-171 - 2007
- [c4]Cosmin E. Oancea, Alan Mycroft:
A Lightweight Model for Software Thread-Level Speculation (TLS). PACT 2007: 419 - 2005
- [c3]Cosmin E. Oancea, Stephen M. Watt:
Domains and expressions: an interface between two approaches to computer algebra. ISSAC 2005: 261-268 - [c2]Cosmin E. Oancea, Stephen M. Watt:
Parametric polymorphism for software component architectures. OOPSLA 2005: 147-166 - [c1]Cosmin E. Oancea, Jason W. A. Selby, Mark Giesbrecht, Stephen M. Watt:
Distributed Models of Thread Level Speculation. PDPTA 2005: 920-927
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-10-07 22:08 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:
