default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaith Sakka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Laith Sakka, Pedro Pedreira, Orri Erling, Masha Basmanova, Kevin Wilfong, Wei He, Xiaoxuan Meng, Krishna Pai, Bikramjeet Vig:
Simple (yet Efficient) Function Authoring for Vectorized Engines. Proc. VLDB Endow. 17(12): 4187-4199 (2024)- [j4]Vidush Singhal
, Laith Sakka, Kirshanthan Sundararajah, Ryan Newton, Milind Kulkarni:
Orchard: Heterogeneous Parallelism and Fine-grained Fusion for Complex Tree Traversals. ACM Trans. Archit. Code Optim. 21(2): 41 (2024) - 2022
- [j3]Pedro Pedreira, Orri Erling, Maria Basmanova, Kevin Wilfong, Laith Sakka, Krishna Pai, Wei He, Biswapesh Chattopadhyay:
Velox: Meta's Unified Execution Engine. Proc. VLDB Endow. 15(12): 3372-3384 (2022) - 2021
- [c5]Maksim Panchenko, Rafael Auler, Laith Sakka, Guilherme Ottoni:
Lightning BOLT: powerful, fast, and scalable binary optimization. CC 2021: 119-130
2010 – 2019
- 2019
- [c4]Michael Vollmer, Chaitanya Koparkar, Mike Rainey, Laith Sakka, Milind Kulkarni, Ryan R. Newton:
LoCal: a language for programs operating on serialized data. PLDI 2019: 48-62 - [c3]Laith Sakka, Kirshanthan Sundararajah, Ryan R. Newton, Milind Kulkarni:
Sound, fine-grained traversal fusion for heterogeneous trees. PLDI 2019: 830-844 - [i1]Laith Sakka, Kirshanthan Sundararajah, Ryan R. Newton, Milind Kulkarni:
Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version. CoRR abs/1904.07061 (2019) - 2017
- [j2]Laith Sakka, Kirshanthan Sundararajah, Milind Kulkarni:
TreeFuser: a framework for analyzing and fusing general recursive tree traversals. Proc. ACM Program. Lang. 1(OOPSLA): 76:1-76:30 (2017) - [c2]Kirshanthan Sundararajah, Laith Sakka, Milind Kulkarni:
Locality Transformations for Nested Recursive Iteration Spaces. ASPLOS 2017: 281-295 - [c1]Michael Vollmer, Sarah Spall, Buddhika Chamith, Laith Sakka, Chaitanya Koparkar, Milind Kulkarni, Sam Tobin-Hochstadt, Ryan Newton:
Compiling Tree Transforms to Operate on Packed Representations. ECOOP 2017: 26:1-26:29 - 2015
- [j1]Ghassan Shobaki, Laith Sakka, Najm Eldeen Abu Rmaileh, Hasan Al-Hamash:
Experimental evaluation of various register-pressure-reduction heuristics. Softw. Pract. Exp. 45(11): 1497-1517 (2015)
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-12-22 19:58 CET 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:
