Alexander Sprintson

Orcid: 0000-0002-5768-5800

According to our database1, Alexander Sprintson authored at least 157 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval.
CoRR, 2024

2023
Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes.
IEEE Trans. Commun., December, 2023

Flow Correlator: A Flow Table Cache Management Strategy.
CoRR, 2023

2022
Latency and Alphabet Size in the Context of Multicast Network Coding.
IEEE Trans. Inf. Theory, 2022

SIMD-Matcher: A SIMD-based Arbitrary Matching Framework.
ACM Trans. Archit. Code Optim., 2022

Single-Server Private Linear Transformation: The Joint Privacy Case.
IEEE J. Sel. Areas Commun., 2022

The Linear Capacity of Single-Server Individually-Private Information Retrieval With Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2022

The Role of Reusable and Single-Use Side Information in Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Group Testing on General Set-Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Multi-Message Private Information Retrieval: A Scalar Linear Solution.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Degree Tables for Private Information Retrieval.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Noisy Group Testing with Side Information.
Proceedings of the 56th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2022, Pacific Grove, CA, USA, October 31, 2022

2021
The Role of Coded Side Information in Single-Server Private Information Retrieval.
IEEE Trans. Inf. Theory, 2021

Joint Index Coding and Incentive Design for Selfish Clients.
IEEE Trans. Commun., 2021

Download Time Analysis for Distributed Storage Codes With Locality and Availability.
IEEE Trans. Commun., 2021

Single-Server Private Information Retrieval Schemes are Equivalent to Locally Recoverable Coding Schemes.
IEEE J. Sel. Areas Inf. Theory, 2021

Scheduling Improves the Performance of Belief Propagation for Noisy Group Testing.
CoRR, 2021

Single-Server Private Linear Transformation: The Individual Privacy Case.
CoRR, 2021

Multi-Server Private Linear Transformation with Joint Privacy.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Multi-Server Private Linear Computation with Joint and Individual Privacy Guarantees.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Single-Server Individually-Private Information Retrieval: A Combinatorial Approach.
Proceedings of the IEEE Information Theory Workshop, 2021

Minimizing the Alphabet Size in Codes with Restricted Error Sets.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Private Linear Transformation: The Individual Privacy Case.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Private Linear Transformation: The Joint Privacy Case.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Private Information Retrieval With Side Information.
IEEE Trans. Inf. Theory, 2020

Secure Erasure Codes With Partial Reconstructibility.
IEEE Trans. Inf. Theory, 2020

Efficient Storage Schemes for Desired Service Rate Regions.
Proceedings of the IEEE Information Theory Workshop, 2020

A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Private Computation with Individual and Joint Privacy.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Minimizing the alphabet size of erasure codes with restricted decoding sets.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Securing Next-Generation Wireless Networks: Challenges and Opportunities (Extended Abstract).
Proceedings of the Decision and Game Theory for Security - 11th International Conference, 2020

2019
Codes With Locality in the Rank and Subspace Metrics.
IEEE Trans. Inf. Theory, 2019

GenMatcher: A Generic Clustering-Based Arbitrary Matching Framework.
ACM Trans. Archit. Code Optim., 2019

Analyzing the Download Time of Availability Codes.
CoRR, 2019

Sparse Graph Codes for Non-adaptive Quantitative Group Testing.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Single-Server Single-Message Online Private Information Retrieval with Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Private Computation with Side Information: The Single-Server Case.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Single-Server Multi-Message Individually-Private Information Retrieval with Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Multi-Server Private Information Retrieval with Coded Side Information.
Proceedings of the 16th Canadian Workshop on Information Theory, 2019

Private Information Retrieval with Private Coded Side Information: The Multi-Server Case.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
A Fast and Accurate Failure Frequency Approximation for k-Terminal Reliability Systems.
IEEE Trans. Reliab., 2018

On the Packet Decoding Delay of Linear Network Coded Wireless Broadcast.
CoRR, 2018

Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information.
Proceedings of the IEEE Information Theory Workshop, 2018

A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring Scale.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish Users.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

28-GHz Channel Measurements and Modeling for Suburban Environments.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

Coded Caching with Low Per-Request Complexity.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
An in-network packet processing architecture for distributed data storage.
Proceedings of the 2017 IEEE Conference on Network Softwarization, 2017

Security for minimum storage regenerating codes and locally repairable codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Successive local and successive global omniscience.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

An algebraic-combinatorial proof technique for the GM-MDS conjecture.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

StorageFlow: SDN-enabled efficient data regeneration for distributed storage systems.
Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

Universally weakly secure coset coding schemes for minimum storage regenerating (MSR) codes.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Private information retrieval with side information: The single server case.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
GCA: Global Congestion Awareness for Load Balance in Networks-on-Chip.
IEEE Trans. Parallel Distributed Syst., 2016

Successive Omniscience.
IEEE Trans. Inf. Theory, 2016

Optimal exchange of data over broadcast networks with adversaries.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Codes with unequal locality.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Cooperative data exchange with priority classes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Flowcache: A cache-based approach for improving SDN scalability.
Proceedings of the IEEE Conference on Computer Communications Workshops, 2016

Feedback-Assisted Random Linear Network Coding in Wireless Broadcast.
Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

Rank-metric codes with local recoverability.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Cooperative data exchange: A coalition game perspective.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Enabling Dynamic Reconfigurability of SDRs Using SDN Principles.
Proceedings of the Ad Hoc Networks - 8th International Conference, 2016

2015
Analysis and Implementation of Asynchronous Physical Layer Network Coding.
IEEE Trans. Wirel. Commun., 2015

Opportunities for Network Coding: To Wait or Not to Wait.
IEEE/ACM Trans. Netw., 2015

The Benefit of Limited Feedback to Generation-Based Random Linear Network Coding in Wireless Broadcast.
CoRR, 2015

CrossFlow: A cross-layer architecture for SDR using SDN principles.
Proceedings of the IEEE Conference on Network Function Virtualization and Software Defined Networks, 2015

Flowsim: Interactive SDN switch visualization.
Proceedings of the IEEE Conference on Network Function Virtualization and Software Defined Networks, 2015

On minimizing the average packet decoding delay in wireless network coded broadcast.
Proceedings of the 2015 International Symposium on Network Coding, 2015

Successive omniscience.
Proceedings of the 2015 International Symposium on Network Coding, 2015

Talking reliably, secretly, and efficiently: A "complete" characterization.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Approximation algorithms for erasure correcting Data Exchange.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Coding against a limited-view adversary: The effect of causality and feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Analyzing the download time of availability codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Reliability analysis of modem substations considering cyber link failures.
Proceedings of the 2015 IEEE Innovative Smart Grid Technologies, 2015

ÆtherFlow: Principled Wireless Support in SDN.
Proceedings of the 23rd IEEE International Conference on Network Protocols, 2015

When do the availability codes make the stored data more available?
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Cooperative data exchange with unreliable clients.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Reliable and secure communication over adversarial multipath networks: A survey.
Proceedings of the 10th International Conference on Information, 2015

2014
Reliability Modeling and Analysis of IEC 61850 Based Substation Protection Systems.
IEEE Trans. Smart Grid, 2014

Multipath Wireless Network Coding: An Augmented Potential Game Perspective.
IEEE/ACM Trans. Netw., 2014

Network Coding Decisions for Wireless Transmissions With Delay Consideration.
IEEE Trans. Commun., 2014

Optimization of discrete broadcast under uncertainty using conditional value-at-risk.
Optim. Lett., 2014

tinyNBI: distilling an API from essential OpenFlow abstractions.
Proceedings of the third workshop on Hot topics in software defined networking, 2014

On error correcting algorithms for the cooperative data exchange problem.
Proceedings of the International Symposium on Network Coding, 2014

Weakly secure regenerating codes for distributed storage.
Proceedings of the International Symposium on Network Coding, 2014

Reductions techniques for establishing equivalence between different classes of network and index coding problems.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Reliable, deniable and hidable communication: A quick survey.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Weakly secure data exchange with Generalized Reed Solomon codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Reliable, deniable, and hidable communication over multipath networks.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Stochastic Pre-classification for SDN Data Plane Matching.
Proceedings of the 22nd IEEE International Conference on Network Protocols, 2014

On a weakly secure regenerating code construction for minimum storage regime.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
A non-monetary protocol for peer-to-peer content distribution in wireless broadcast networks with network coding.
Proceedings of the 11th International Symposium and Workshops on Modeling and Optimization in Mobile, 2013

GCA: Global congestion awareness for load balance in Networks-on-Chip.
Proceedings of the 2013 Seventh IEEE/ACM International Symposium on Networks-on-Chip (NoCS), 2013

Algorithms for weakly secure data exchange.
Proceedings of the International Symposium on Network Coding, 2013

The Index Coding problem: A game-theoretical perspective.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Eliminating network protocol vulnerabilities through abstraction and systems language design.
Proceedings of the 2013 21st IEEE International Conference on Network Protocols, 2013

Bidirectional interconnect design for low latency high bandwidth NoC.
Proceedings of 2013 International Conference on IC Design & Technology, 2013

Stochastic Pre-Classification for Software Defined Firewalls.
Proceedings of the 22nd International Conference on Computer Communication and Networks, 2013

Supporting Voice over LTE: Solutions, Architectures, and Protocols.
Proceedings of the 22nd International Conference on Computer Communication and Networks, 2013

Truthful and non-monetary mechanism for direct data exchange.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Secure Network Coding for Wiretap Networks of Type II.
IEEE Trans. Inf. Theory, 2012

Signal processing, communication, and networking requirements for synchrophasor systems.
Proceedings of the 13th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2012

Opportunistic network coding: Competitive analysis.
Proceedings of the International Symposium on Network Coding, 2012

2011
Efficient Congestion Mitigation Using Congestion-Aware Steiner Trees and Network Coding Topologies.
VLSI Design, 2011

Robust network codes for unicast connections: a case study.
IEEE/ACM Trans. Netw., 2011

On the Hardness of Approximating the Network Coding Capacity.
IEEE Trans. Inf. Theory, 2011

Asynchronous Bypass Channels for Multi-Synchronous NoCs: A Router Microarchitecture, Topology, and Routing Algorithm.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011

An algorithm for cooperative data exchange with cost criterion.
Proceedings of the Information Theory and Applications Workshop, 2011

Opportunities for network coding: To wait or not to wait.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the complementary Index Coding problem.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Weakly Secure Network Coding for Wireless Cooperative Data Exchange.
Proceedings of the Global Communications Conference, 2011

Parameter Estimation and Tracking in Physical Layer Network Coding.
Proceedings of the Global Communications Conference, 2011

Finding Sparse Solutions for the Index Coding Problem.
Proceedings of the Global Communications Conference, 2011

2010
Network Coding and Its Applications in Communication Networks.
Proceedings of the Algorithms for Next Generation Networks, 2010

Joint Physical Layer Coding and Network Coding for Bidirectional Relaying.
IEEE Trans. Inf. Theory, 2010

On the index coding problem and its relation to network coding and matroid theory.
IEEE Trans. Inf. Theory, 2010

Estimating cellular network performance during hurricanes.
Reliab. Eng. Syst. Saf., 2010

On Coding for Cooperative Data Exchange
CoRR, 2010

Efficient traffic loss evaluation for transport backbone networks.
Comput. Networks, 2010

Deterministic Algorithm for Coded Cooperative Data Exchange.
Proceedings of the Quality, Reliability, Security and Robustness in Heterogeneous Networks, 2010

Asynchronous Bypass Channels: Improving Performance for Multi-synchronous NoCs.
Proceedings of the NOCS 2010, 2010

A randomized algorithm and performance bounds for coded cooperative data exchange.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Multipath Wireless Network Coding: A Population Game Perspective.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

An Optimal Solution to the Distributed Data Retrieval Problem.
Proceedings of the Global Communications Conference, 2010

Modeling performance of interdependent power and water networks during urban fire events.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Network Coding: A Computational Perspective.
IEEE Trans. Inf. Theory, 2009

Efficient Rerouting Algorithms for Congestion Mitigation.
Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2009

A new construction method for networks from matroids.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Design of efficient robust network codes for multicast connections.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Optimal Universal Schedules for Discrete Broadcast.
IEEE Trans. Inf. Theory, 2008

Joint Physical Layer Coding and Network Coding for Bi-Directional Relaying
CoRR, 2008

Toward a new route control model for multidomain optical networks.
IEEE Commun. Mag., 2008

On the relation between the Index Coding and the Network Coding problems.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
CoRR, 2007

Bounds on Codes Based on Graph Theory.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
The encoding complexity of network coding.
IEEE Trans. Inf. Theory, 2006

Efficient algorithms for shared backup allocation in networks with partial information.
J. Comb. Optim., 2006

On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains.
IEEE Commun. Mag., 2006

Network Coding in Minimal Multicast Networks.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Anti-Jamming Schedules for Wireless Data Broadcast Systems.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Network coding for routability improvement in VLSI.
Proceedings of the 2006 International Conference on Computer-Aided Design, 2006

2005
A scalable approach to the partition of QoS requirements in unicast and multicast.
IEEE/ACM Trans. Netw., 2005

Algorithms for computing QoS paths with restoration.
IEEE/ACM Trans. Netw., 2005

Staleness vs. waiting time in universal discrete broadcast.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Efficient Algorithms for Computing Disjoint QoS Paths.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003
Precomputation schemes for QoS routing.
IEEE/ACM Trans. Netw., 2003

Algorithms for Computing QoS Paths with Restoration.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2000
QoS Routing: The Precomputation Perspective.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000


  Loading...