Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Avi Levy

dblp:48/4706 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 2 · 1 first-authorComputer networks · 1 · 1 since 2021Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 77% Cloud and datacenter computing · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › networked storage › storage networking
RDMA storage
0.712023
Empowering Azure Storage with RDMA · NSDI 2023
Cloud and datacenter computing
cloud storage
0.212023
Empowering Azure Storage with RDMA · NSDI 2023
YearPublicationVenuePosition
2023 Empowering Azure Storage with RDMA
Wei Bai 0001, Shanim Sainul Abdeen, Ankit Agrawal 0013, Krishan Kumar Attre, Paramvir Bahl, Ameya Bhagat, Gowri Bhaskara, Tanya Brokhman, Ahmad Cheema, Rebecca Chow, Jeff Cohen, Mahmoud Elhaddad, Vivek Ette, Igal Figlin, Daniel Firestone, Mathew George, Ilya German, Lakhmeet Ghai, Eric Green, Albert G. Greenberg, Randy Haagens, Matthew Hendel, Ridwan Howlader, Neetha John, Julia Johnstone, Tom Jolly, Greg Kramer, David Kruse, Erica Lan, Avi Levy, Marina Lipshteyn, Guohan Lu, Yuemin Lu, Xiakun Lu, Vadim Makhervaks, Ulad Malashanka, David A. Maltz, Ilias Marinos, Rohan Mehta, Sharda Murthi, Anup Namdhari, Aaron Ogus, Jitendra Padhye, Madhav Pandya, Douglas Phillips, Adrian Power, Suraj Puri, Shachar Raindel, Jordan Rhee, Anthony Russo, Maneesh Sah, Ali Sheriff, Chris Sparacino, Ashutosh Srivastava, Weixiang Sun, Nick Swanson, Fuhou Tian, Lukasz Tomczyk, Vamsi Vadlamuri, Alec Wolman, Joyce Yom, Yanzhao Zhang, Brian Zill
NSDI34
2018 Constructing permutation arrays from groups
Sergey Bereg, Avi Levy, Ivan Hal Sudborough
Des. Codes Cryptogr.2
2018 Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra
abstract
We propose an algebraic framework for generalized graph Laplacians which unifies the study of resistor networks, the critical group, and the eigenvalues of the Laplacian and adjacency matrices. Given a graph with boundary $G$ together with a generalized Laplacian $L$ with entries in a commutative ring $R$, we define a generalized critical group $\Upsilon_R(G,L)$. We relate $\Upsilon_R(G,L)$ to spaces of harmonic functions on the network using the Hom, Tor, and Ext functors of homological algebra. We study how these algebraic objects transform under combinatorial operations on the network $(G,L)$, including harmonic morphisms, layer-stripping, duality, and symmetry. In particular, we use layer-stripping operations from the theory of resistor networks to systematize discrete harmonic continuation. This leads to an algebraic characterization of the graphs with boundary that can be completely layer-stripped, an algorithm for simplifying computation of $\Upsilon_R(G,L)$, and upper bounds for the number of invariant factors in the critical group and the multiplicity of Laplacian eigenvalues in terms of geometric quantities.
David Jekel, Avi Levy, Will Dana, Austin J. Stromme, Collin Litterell
SIAM J. Discret. Math.2
2017 Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
Avi Levy, Harishchandra Ramadas, Thomas Rothvoß
IPCO1
2005 Spatial de-interlacing using dynamic time warping
abstract
Spatial de-interlacing is an essential part of motion adaptive de-interlacing used for reconstructing missing lines in cases of fast motion detection. Common spatial de-interlacing algorithms often produce artifacts in the output image, especially along edges with flat horizontal angles. In this paper we introduce a new method for spatial de-interlacing based on the dynamic time warping (DTW) procedure. The DTW algorithm finds an alignment between two original consecutive lines, and then, the missing line between them is reconstructed based on this alignment. This method preserves the smoothness of the original image edges and produces a high quality progressive image.
Assaf Almog, Avi Levy, Alfred M. Bruckstein
ICIP (2)2
2003 Graphical indicia
abstract
We present an authenticate graphical barcode symbology, and describe a system for its reliable encoding and decoding is presented. The graphical barcode is generated by modulating halftone patterns according to the message to be embedded in the barcode during the rendering of a base image. The generated barcode has the appearance of the base image, and when it is printed and scanned back in, the message can be retrieved. A graphical indicium is a graphical barcode embedded with a digitally signed message such that the integrity and authenticity of the message can be verified.
Doron Shaked, Zachi Baharav, Avi Levy, Jonathan Yen, Chit Wei Saw
ICIP (1)3