default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandros Sobczyk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c5]Aleksandros Sobczyk:
Deterministic Complexity Analysis of Hermitian Eigenproblems. ICALP 2025: 131:1-131:21- [c4]Pál András Papp
, Aleksandros Sobczyk, Albert-Jan Nicholas Yzelman:
The Impact of Partial Computations on the Red-Blue Pebble Game. SPAA 2025: 328-338 - [i10]Jannis Born, Filip Skogh, Kahn Rhrissorrakrai, Filippo Utro, Nico Wagner, Aleksandros Sobczyk:
Quantum Doubly Stochastic Transformers. CoRR abs/2504.16275 (2025) - [i9]Pál András Papp, Aleksandros Sobczyk, A. N. Yzelman:
The Impact of Partial Computations on the Red-Blue Pebble Game. CoRR abs/2506.10854 (2025) - [i8]Aleksandros Sobczyk, Giuseppe Sorrentino, Anastasios Zouzias:
Segmented Operations using Matrix Multiplications. CoRR abs/2506.23906 (2025) - [i7]Almudena Carrera Vazquez, Aleksandros Sobczyk:
Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation. CoRR abs/2508.21002 (2025) - 2024
- [c3]Aleksandros Sobczyk, Marko Mladenovic, Mathieu Luisier:
Invariant subspaces and PCA in nearly matrix multiplication time. NeurIPS 2024 - [i6]Aleksandros Sobczyk:
Deterministic complexity analysis of Hermitian eigenproblems. CoRR abs/2410.21550 (2024) - [i5]Aleksandros Sobczyk:
I/O complexity and pebble games with partial computations. CoRR abs/2410.22237 (2024) - 2023
- [i4]Aleksandros Sobczyk, Marko Mladenovic, Mathieu Luisier:
Hermitian Pseudospectral Shattering, Cholesky, Hermitian Eigenvalues, and Density Functional Theory in Nearly Matrix Multiplication Time. CoRR abs/2311.10459 (2023) - 2022
- [j3]Aleksandros Sobczyk, Efstratios Gallopoulos:
pylspack: Parallel Algorithms and Data Structures for Sketching, Column Subset Selection, Regression, and Leverage Scores. ACM Trans. Math. Softw. 48(4): 44:1-44:27 (2022) - [c2]Aleksandros Sobczyk, Mathieu Luisier:
Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss. NeurIPS 2022 - [i3]Aleksandros Sobczyk, Efstratios Gallopoulos:
pylspack: Parallel algorithms and data structures for sketching, column subset selection, regression and leverage scores. CoRR abs/2203.02798 (2022) - [i2]Aleksandros Sobczyk, Mathieu Luisier:
Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss. CoRR abs/2205.12307 (2022) - 2021
- [j2]Aleksandros Sobczyk, Efstratios Gallopoulos:
Estimating Leverage Scores via Rank Revealing Methods and Randomization. SIAM J. Matrix Anal. Appl. 42(3): 1199-1228 (2021) - [i1]Aleksandros Sobczyk, Efstratios Gallopoulos:
Estimating leverage scores via rank revealing methods and randomization. CoRR abs/2105.11004 (2021)
2010 – 2019
- 2015
- [j1]Ioannis E. Venetis, Alexandros Kouris, Alexandros Sobczyk, Efstratios Gallopoulos, Ahmed H. Sameh:
A direct tridiagonal solver based on Givens rotations for GPU architectures. Parallel Comput. 49: 101-116 (2015) - [c1]Ioannis E. Venetis, Alexandros Sobczyk, Alexandros Kouris, Alexandros Nakos, Nikolaos Nikoloutsakos, Efstratios Gallopoulos:
A general tridiagonal solver for coprocessors: Adapting g-Spike for the Intel Xeon Phi. PARCO 2015: 371-380
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 2025-09-27 03:17 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:
