default search action
Adam Morrison 0001
Person information
- affiliation: Tel Aviv University, Israel
Other persons with the same name
- Adam Morrison 0002 — Valparaiso University, IN, USA
- Adam Morrison 0003 — Rice University, Houston, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c59]Zirui Neil Zhao
, Adam Morrison
Everywhere All at Once: Co-Location Attacks on Public Cloud FaaS. ASPLOS (1) 2024: 133-149 - [c58]Zirui Neil Zhao
Last-Level Cache Side-Channel Attacks Are Feasible in the Modern Public Cloud. ASPLOS (2) 2024: 582-600 - [i10]Zirui Neil Zhao, Adam Morrison, Christopher W. Fletcher, Josep Torrellas:
Last-Level Cache Side-Channel Attacks Are Feasible in the Modern Public Cloud (Extended Version). CoRR abs/2405.12469 (2024) - 2023
- [j13]Chen Dar
RLS Side Channels: Investigating Leakage of Row-Level Security Protected Data Through Query Execution Time. Proc. ACM Manag. Data 1(1): 89:1-89:25 (2023) - [c57]Zirui Neil Zhao, Adam Morrison, Christopher W. Fletcher, Josep Torrellas:
Untangle: A Principled Framework to Design Low-Leakage, High-Performance Dynamic Partitioning Schemes. ASPLOS (3) 2023: 771-788 - [c56]Rutvik Choudhary
Declassiflow: A Static Analysis for Modeling Non-Speculative Knowledge to Relax Speculative Execution Security Measures. CCS 2023: 2053-2067 - [c55]Boris Pismenny, Adam Morrison, Dan Tsafrir:
ShRing: Networking with Shared Receive Rings. OSDI 2023: 949-968 - [c54]Serif Yesil, Azin Heidarshenas, Adam Morrison, Josep Torrellas:
WISE: Predicting the Performance of Sparse Matrix Vector Multiplication with Machine Learning. PPoPP 2023: 329-341 - [c53]Adi Kaufman, Moshik Hershcovitch, Adam Morrison:
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure. USENIX ATC 2023: 719-733 - [i9]Adi Kafuman, Moshik Hershcovitch, Adam Morrison:
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version). CoRR abs/2306.04602 (2023) - [i8]Rutvik Choudhary, Alan Wang, Zirui Neil Zhao, Adam Morrison, Christopher W. Fletcher:
DECLASSIFLOW: A Static Analysis for Modeling Non-Speculative Knowledge to Relax Speculative Execution Security Measures (Full Version). CoRR abs/2312.09336 (2023) - 2022
- [j12]Tomer Even, Guy Even, Adam Morrison:
Prefix Filter: Practically and Theoretically Better Than Bloom. Proc. VLDB Endow. 15(7): 1311-1323 (2022) - [c52]Zirui Neil Zhao
Pinned loads: taming speculative loads in secure processors. ASPLOS 2022: 314-328 - [c51]Boris Pismenny
The benefits of general-purpose on-NIC memory. ASPLOS 2022: 1130-1147 - [c50]Moshik Hershcovitch, Artem Khyzha, Daniel G. Waddington, Adam Morrison:
Elastic Indexes: Dynamic Space vs. Query Efficiency Tuning for In-Memory Database Indexing. EDBT 2022: 2:312-2:324 - [c49]Tomer Shanny, Adam Morrison:
Occualizer: Optimistic Concurrent Search Trees From Sequential Code. OSDI 2022: 321-337 - [c48]Jose Rodrigo Sanchez Vicarte, Michael Flanders, Riccardo Paccagnella, Grant Garrett-Grossman, Adam Morrison, Christopher W. Fletcher, David Kohlbrenner:
Augury: Using Data Memory-Dependent Prefetchers to Leak Data at Rest. SP 2022: 1491-1505 - [c47]Oz Anani, Gal Lushi, Moshik Hershcovitch, Adam Morrison:
Evaluating compressed indexes in DBMS. SYSTOR 2022: 149 - [c46]Omri Arad, Yoav Ben Shimon, Ron Zadicario, Daniel G. Waddington, Moshik Hershcovitch, Adam Morrison:
System-level crash safe sorting on persistent memory. SYSTOR 2022: 151 - [c45]Dmitry Kuznetsov, Adam Morrison:
Privbox: Faster System Calls Through Sandboxed Privileged Execution. USENIX ATC 2022 - [c44]Zirui Neil Zhao, Adam Morrison, Christopher W. Fletcher, Josep Torrellas:
Binoculars: Contention-Based Side-Channel Attacks Exploiting the Page Walker. USENIX Security Symposium 2022: 699-716 - [i7]Adar Zeitak, Adam Morrison:
Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing. CoRR abs/2201.09331 (2022) - [i6]Tomer Even, Guy Even, Adam Morrison:
Prefix Filter: Practically and Theoretically Better Than Bloom. CoRR abs/2203.17139 (2022) - 2021
- [j11]Jiyong Yu
Speculative taint tracking (STT): a comprehensive protection for speculatively accessed data. Commun. ACM 64(12): 105-112 (2021) - [j10]Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and space complexity of collaborative text editing. Theor. Comput. Sci. 855: 141-160 (2021) - [c43]Boris Pismenny
Autonomous NIC offloads. ASPLOS 2021: 18-35 - [c42]Mohammad Behnia, Prateek Sahu, Riccardo Paccagnella
Speculative interference attacks: breaking invisible speculation schemes. ASPLOS 2021: 1046-1060 - [c41]Alex Markuze, Shay Vargaftik, Gil Kupfer, Boris Pismenny
Characterizing, exploiting, and detecting DMA code injection vulnerabilities in the presence of an IOMMU. EuroSys 2021: 395-409 - [c40]Jose Rodrigo Sanchez Vicarte
Opening Pandora's Box: A Systematic Study of New Ways Microarchitecture Can Leak Private Data. ISCA 2021: 347-360 - [c39]Rutvik Choudhary, Jiyong Yu
Speculative Privacy Tracking (SPT): Leaking Information From Speculative Execution Without Compromising Privacy. MICRO 2021: 607-622 - [c38]Daniel Solomon, Adam Morrison:
Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory. PPoPP 2021: 191-204 - [c37]Adar Zeitak, Adam Morrison:
Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing. SOSP 2021: 147-162 - [c36]Ofek Kirzner, Adam Morrison:
An Analysis of Speculative Type Confusion Vulnerabilities in the Wild. USENIX Security Symposium 2021: 2399-2416 - [i5]Ofek Kirzner, Adam Morrison:
An Analysis of Speculative Type Confusion Vulnerabilities in the Wild. CoRR abs/2106.15601 (2021) - 2020
- [j9]Jiyong Yu
Speculative Taint Tracking (STT): A Comprehensive Protection for Speculatively Accessed Data. IEEE Micro 40(3): 81-90 (2020) - [j8]Yotam M. Y. Feldman
Proving highly-concurrent traversals correct. Proc. ACM Program. Lang. 4(OOPSLA): 128:1-128:29 (2020) - [c35]Igor Smolyar, Alex Markuze, Boris Pismenny
IOctopus: Outsmarting Nonuniform DMA. ASPLOS 2020: 101-115 - [c34]Azin Heidarshenas, Serif Yesil, Dimitrios Skarlatos, Sasa Misailovic, Adam Morrison, Josep Torrellas:
V-Combiner: speeding-up iterative graph processing on a shared-memory platform with vertex merging. ICS 2020: 9:1-9:13 - [c33]Azin Heidarshenas, Tanmay Gangwani, Serif Yesil, Adam Morrison, Josep Torrellas:
Snug: architectural support for relaxed concurrent priority queueing in chip multiprocessors. ICS 2020: 18:1-18:13 - [c32]Jiyong Yu
Speculative Data-Oblivious Execution: Mobilizing Safe Prediction For Safe and Efficient Speculative Execution. ISCA 2020: 707-720 - [c31]Zirui Neil Zhao, Houxiang Ji
Speculation Invariance (InvarSpec): Faster Safe Execution Through Program Analysis. MICRO 2020: 1138-1152 - [c30]Daniel Katzan, Adam Morrison
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. OPODIS 2020: 15:1-15:16 - [c29]Or Ostrovsky, Adam Morrison:
Scaling concurrent queues by using HTM to profit from failed atomic operations. PPoPP 2020: 89-101 - [c28]Serif Yesil, Azin Heidarshenas, Adam Morrison, Josep Torrellas:
Speeding up SpMV for power-law graph analytics by enhancing locality & vectorization. SC 2020: 86 - [i4]Mohammad Behnia, Prateek Sahu, Riccardo Paccagnella, Jiyong Yu, Zirui Neil Zhao, Xiang Zou, Thomas Unterluggauer, Josep Torrellas, Carlos V. Rozas, Adam Morrison, Frank McKeen, Fangfei Liu, Ron Gabor, Christopher W. Fletcher, Abhishek Basak, Alaa R. Alameldeen:
Speculative Interference Attacks: Breaking Invisible Speculation Schemes. CoRR abs/2007.11818 (2020) - [i3]Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham:
Proving Highly-Concurrent Traversals Correct. CoRR abs/2010.00911 (2020) - [i2]Daniel Katzan, Adam Morrison:
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. CoRR abs/2011.07622 (2020)
2010 – 2019
- 2019
- [c27]Jiyong Yu
Speculative Taint Tracking (STT): A Comprehensive Protection for Speculatively Accessed Data. MICRO 2019: 954-968 - [c26]Mengjia Yan, Jiho Choi, Dimitrios Skarlatos, Adam Morrison, Christopher W. Fletcher, Josep Torrellas:
InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy (Corrigendum). MICRO 2019: 1076 - [c25]Serif Yesil, Azin Heidarshenas, Adam Morrison, Josep Torrellas:
Understanding priority-based scheduling of graph algorithms on a shared-memory platform. SC 2019: 46:1-46:14 - [e1]Moshik Hershcovitch, Ashvin Goel, Adam Morrison:
Proceedings of the 12th ACM International Conference on Systems and Storage, SYSTOR 2019, Haifa, Israel, June 3-5, 2019. ACM 2019, ISBN 978-1-4503-6749-3 [contents] - 2018
- [c24]Alex Markuze, Igor Smolyar, Adam Morrison, Dan Tsafrir:
DAMN: Overhead-Free IOMMU Protection for Networking. ASPLOS 2018: 301-315 - [c23]Mengjia Yan
InvisiSpec: Making Speculative Execution Invisible in the Cache Hierarchy. MICRO 2018: 428-441 - [c22]Adam Alon, Adam Morrison:
Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity. PODC 2018: 27-36 - [c21]Maya Arbel-Raviv, Trevor Brown, Adam Morrison:
Getting to the Root of Concurrent Binary Search Tree Performance. USENIX ATC 2018: 295-306 - [c20]Yotam M. Y. Feldman
Order out of Chaos: Proving Linearizability Using Local Views. DISC 2018: 23:1-23:21 - [i1]Yotam M. Y. Feldman, Constantin Enea, Adam Morrison, Noam Rinetzky, Sharon Shoham:
Order out of Chaos: Proving Linearizability Using Local Views. CoRR abs/1805.03992 (2018) - 2017
- [j7]Hagit Attiya
Limitations of Highly-Available Eventually-Consistent Data Stores. IEEE Trans. Parallel Distributed Syst. 28(1): 141-155 (2017) - 2016
- [j6]Adam Morrison
Scaling synchronization in multicore programs. Commun. ACM 59(11): 44-51 (2016) - [j5]Adam Morrison:
Scaling Synchronization in Multicore Programs. ACM Queue 14(4): 20 (2016) - [c19]Alex Markuze, Adam Morrison, Dan Tsafrir:
True IOMMU Protection from DMA Attacks: When Copy is Faster than Zero Copy. ASPLOS 2016: 249-262 - [c18]Tanmay Gangwani, Adam Morrison, Josep Torrellas:
CASPAR: Breaking Serialization in Lock-Free Multicore Synchronization. ASPLOS 2016: 789-804 - [c17]Hagit Attiya
Specification and Complexity of Collaborative Text Editing. PODC 2016: 259-268 - 2015
- [c16]Adam Morrison, Yehuda Afek:
Temporally Bounding TSO for Fence-Free Asymmetric Synchronization. ASPLOS 2015: 45-58 - [c15]Orr Tamir, Adam Morrison, Noam Rinetzky:
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms. OPODIS 2015: 15:1-15:16 - [c14]Hagit Attiya
Limitations of Highly-Available Eventually-Consistent Data Stores. PODC 2015: 385-394 - [c13]Maya Arbel, Adam Morrison:
Predicate RCU: an RCU for scalable concurrent updates. PPoPP 2015: 21-30 - [c12]Omer Peleg, Adam Morrison, Benjamin Serebrin, Dan Tsafrir:
Utilizing the IOMMU Scalably. USENIX ATC 2015: 549-562 - 2014
- [j4]Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison
The CB tree: a practical concurrent self-adjusting search tree. Distributed Comput. 27(6): 393-417 (2014) - [c11]Adam Morrison, Yehuda Afek:
Fence-free work stealing on bounded TSO processors. ASPLOS 2014: 413-426 - [c10]Yehuda Afek, Amir Levy, Adam Morrison:
Software-improved hardware lock elision. PODC 2014: 212-221 - 2013
- [b1]Adam Morrison:
FAst and Scalable Software Execution on Multicores/ Adam, Morrison. Tel Aviv University, Israel, 2013 - [j3]Yehuda Afek, Michael Hakimi, Adam Morrison:
Fast and scalable rendezvousing. Distributed Comput. 26(4): 243-269 (2013) - [c9]Adam Morrison, Yehuda Afek:
Fast concurrent queues for x86 processors. PPoPP 2013: 103-112 - [c8]Yehuda Afek, Amir Levy, Adam Morrison:
Programming with hardware lock elision. PPoPP 2013: 295-296 - 2012
- [c7]Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan:
CBTree: A Practical Concurrent Self-Adjusting Search Tree. DISC 2012: 1-15 - 2011
- [j2]Michael Hakimi, Adam Morrison:
A review of DISC 2011. SIGACT News 42(4): 87-91 (2011) - [c6]Yehuda Afek, David Dice, Adam Morrison:
Cache index-aware memory allocation. ISMM 2011: 55-64 - [c5]Yehuda Afek, Adam Morrison, Guy Wertheim:
From bounded to unbounded concurrency objects and back. PODC 2011: 119-128 - [c4]Yehuda Afek, Yoav Cohen, Adam Morrison:
Coping with context switches in lock-based software transactional memory. SYSTOR 2011: 11 - [c3]Yehuda Afek, Michael Hakimi, Adam Morrison
Fast and Scalable Rendezvousing. DISC 2011: 16-31 - 2010
- [c2]Yehuda Afek, Adam Morrison, Moran Tzafrir:
Brief announcement: view transactions: transactional model with relaxed consistency checks. PODC 2010: 65-66
2000 – 2009
- 2007
- [j1]Yehuda Afek, Eli Gafni, Adam Morrison
Common2 extended to stacks and unbounded concurrency. Distributed Comput. 20(4): 239-252 (2007) - 2006
- [c1]Yehuda Afek, Eli Gafni, Adam Morrison:
Common2 extended to stacks and unbounded concurrency. PODC 2006: 218-227
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:20 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: