Devavrat Shah
According to our database^{1},
Devavrat Shah
authored at least 164 papers
between 1999 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at dnb.info

at www.mit.edu
On csauthors.net:
Bibliography
2018
Model Agnostic Time Series Analysis via Matrix Estimation.
POMACS, 2018
Robust Synthetic Control.
Journal of Machine Learning Research, 2018
Explaining the Success of Nearest Neighbor Methods in Prediction.
Foundations and Trends in Machine Learning, 2018
Censored Demand Estimation in Retail.
Proceedings of the Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems, 2018
Qlearning with Nearest Neighbors.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Recommender Systems over Wireless: Challenges and Opportunities.
Proceedings of the IEEE Information Theory Workshop, 2018
Prediction Query Language.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018
Reducing Crowdsourcing to Graphon Estimation, Statistically.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018
2017
FeedbackBased Online Network Coding.
IEEE Trans. Information Theory, 2017
Rank Centrality: Ranking from Pairwise Comparisons.
Operations Research, 2017
Flowtune: Flowlet Control for Datacenter Networks.
Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017
Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Matrix Estimation, Latent Variable Model and Collaborative Filtering.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017
2016
Finding Rumor Sources on Random Trees.
Operations Research, 2016
Collaborative Filtering with Low Regret.
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016
Blind Regression: Nonparametric Regression for Latent Variable Models via Collaborative Filtering.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Trading Bitcoin and Online Time Series Prediction.
Proceedings of the NIPS 2016 Time Series Workshop, 2016
Compute Choice.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
A Latent Source Model for PatchBased Image Segmentation.
Proceedings of the Medical Image Computing and ComputerAssisted Intervention  MICCAI 2015  18th International Conference Munich, Germany, October 5, 2015
2014
Introduction to the Issue on Signal Processing for Social Networks [Guest editorial].
J. Sel. Topics Signal Processing, 2014
BudgetOptimal Task Allocation for Reliable Crowdsourcing Systems.
Operations Research, 2014
What's your choice?: learning the mixed multinomial.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014
Fastpass: a centralized "zeroqueue" datacenter network.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014
Learning Mixed Multinomial Logit Model from Ordinal Data.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
Structure learning of antiferromagnetic Ising models.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
Hardness of parameter estimation in graphical models.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
A Latent Source Model for Online Collaborative Filtering.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
Bayesian regression and Bitcoin.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014
Learning graphical models from the Glauber dynamics.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014
2013
Technique for Efficient Evaluation of SRAM Timing Failure.
IEEE Trans. VLSI Syst., 2013
A Nonparametric Approach to Modeling Choice with Limited Data.
Management Science, 2013
Efficient crowdsourcing for multiclass labeling.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013
Computing the Stationary Distribution Locally.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 58, 2013
A Latent Source Model for Nonparametric Time Series Classification.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 58, 2013
2012
Productform distributions and network algorithms (abstract only).
SIGMETRICS Performance Evaluation Review, 2012
Logweight scheduling in switched networks.
Queueing Syst., 2012
Belief Propagation for MinCost Network Flow: Convergence and Correctness.
Operations Research, 2012
Rumor centrality: a universal source detector.
Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012
Optimal queuesize scaling in switched networks.
Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012
Congestion control meets medium access: throughput, delay, and complexity.
Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012
Efficient rank aggregation using partial data.
Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012
Spinal codes.
Proceedings of the ACM SIGCOMM 2012 Conference, 2012
Iterative ranking from pairwise comparisons.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 36, 2012
No symbol left behind: a linklayer protocol for rateless codes.
Proceedings of the 18th Annual International Conference on Mobile Computing and Networking, 2012
Sparse choice models.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012
A hardware spinal decoder.
Proceedings of the Symposium on Architecture for Networking and Communications Systems, 2012
Learning sparse Boolean polynomials.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012
2011
Rumors in a Network: Who's the Culprit?
IEEE Trans. Information Theory, 2011
Hardness of Low Delay Network Scheduling.
IEEE Trans. Information Theory, 2011
Inferring Rankings Using Constrained Sensing.
IEEE Trans. Information Theory, 2011
Fair Scheduling in Networks Through Packet Election.
IEEE Trans. Information Theory, 2011
Reduction of VariationInduced Energy Overhead in MultiCore Processors.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2011
Counting Independent Sets Using the Bethe Approximation.
SIAM J. Discrete Math., 2011
Fluid models of congestion collapse in overloaded switched networks.
Queueing Syst., 2011
Optimal scaling of average queue sizes in an inputqueued switch: an open problem.
Queueing Syst., 2011
Network Coding Meets TCP: Theory and Implementation.
Proceedings of the IEEE, 2011
Iterative Learning for Reliable Crowdsourcing Systems.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 1214 December 2011, 2011
Fast averaging.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Rateless spinal codes.
Proceedings of the Tenth ACM Workshop on Hot Topics in Networks (HotNetsX), 2011
Medium Access Using Queues.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Three metrics for stochastic networks: Capacity, queuesize and complexity.
Proceedings of the Third International Conference on Communication Systems and Networks, 2011
Informational limits of neural circuits.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011
Budgetoptimal crowdsourcing using lowrank matrix approximations.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011
Interference is not noise.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011
Ranking: Compare, don't score.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011
2010
Distributed crosslayer algorithms for the optimal control of multihop wireless networks.
IEEE/ACM Trans. Netw., 2010
The balanced unicast and multicast capacity regions of large wireless networks.
IEEE Trans. Information Theory, 2010
Distributed averaging via lifted Markov chains.
IEEE Trans. Information Theory, 2010
Distributed Random Access Algorithm: Scheduling and Congestion Control.
IEEE Trans. Information Theory, 2010
Functional compression through graph coloring.
IEEE Trans. Information Theory, 2010
Information Theoretic Bounds for Distributed Computation Over Networks of PointtoPoint Channels.
IEEE Trans. Information Theory, 2010
Belief Propagation for Mincost Network Flow: Convergence & Correctness.
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
Detecting sources of computer viruses in networks: theory and experiment.
Proceedings of the SIGMETRICS 2010, 2010
Qualitative properties of alphaweighted scheduling policies.
Proceedings of the SIGMETRICS 2010, 2010
Delay optimal queuebased CSMA.
Proceedings of the SIGMETRICS 2010, 2010
Dynamics in congestion games.
Proceedings of the SIGMETRICS 2010, 2010
Distributed averaging in dynamic networks.
Proceedings of the SIGMETRICS 2010, 2010
On the flowlevel dynamics of a packetswitched network.
Proceedings of the SIGMETRICS 2010, 2010
A simple messagepassing algorithm for compressed sensing.
Proceedings of the IEEE International Symposium on Information Theory, 2010
MessagePassing for Wireless Scheduling: An Experimental Study.
Proceedings of the 19th International Conference on Computer Communications and Networks, 2010
Loop flattening & spherical sampling: Highly efficient model reduction techniques for SRAM yield analysis.
Proceedings of the Design, Automation and Test in Europe, 2010
2009
Message passing for maximum weight independent set.
IEEE Trans. Information Theory, 2009
On capacity scaling in arbitrary wireless networks.
IEEE Trans. Information Theory, 2009
Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem.
Math. Oper. Res., 2009
Gossip Algorithms.
Foundations and Trends in Networking, 2009
Network adiabatic theorem: an efficient randomized protocol for contention resolution.
Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009
Local Rules for Global MAP: When Do They Work ?
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 710 December 2009, 2009
A DataDriven Approach to Modeling Choice.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 710 December 2009, 2009
Caching in wireless networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009
Influence in a large society: Interplay between information dynamics and network structure.
Proceedings of the IEEE International Symposium on Information Theory, 2009
Network Coding Meets TCP.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
The Multicast Capacity Region of Large Wireless Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
Computing the Capacity Region of a Wireless Network.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
Network gossip algorithms.
Proceedings of the IEEE International Conference on Acoustics, 2009
2008
Fast Distributed Algorithms for Computing Separable Functions.
IEEE Trans. Information Theory, 2008
Product Multicommodity Flow in Wireless Networks.
IEEE Trans. Information Theory, 2008
MaxProduct for Maximum Weight Matching: Convergence, Correctness, and LP Duality.
IEEE Trans. Information Theory, 2008
A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints.
IEEE Trans. Automat. Contr., 2008
Revisiting stochastic loss networks: structures and algorithms.
Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008
Optimal delay scheduling in networks with arbitrary constraints.
Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008
Inferring rankings under constrained sensing.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008
Cooperative multihop schemes for arbitrary wireless networks.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008
ARQ for network coding.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
Hierarchical cooperation for arbitrary wireless networks.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
Counting bits for distributed function computation.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
Fair Scheduling through Packet Election.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
Feasible Rate Allocation in Wireless Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
Breaking the simulation barrier: SRAM evaluation through norm minimization.
Proceedings of the 2008 International Conference on ComputerAided Design, 2008
Distributed algorithm and reversible network.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008
Imperfect randomized algorithms for the optimal control of wireless networks.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008
Distributed computation under bit constraints.
Proceedings of the 47th IEEE Conference on Decision and Control, 2008
2007
Throughput Region of FiniteBuffered Networks.
IEEE Trans. Parallel Distrib. Syst., 2007
Throughput and Delay in Random Wireless Networks With Restricted Mobility.
IEEE Trans. Information Theory, 2007
Fully Distributed Algorithms for Convex Optimization Problems.
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Counting good truth assignments of random kSAT formulae.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Message Passing for Maxweight Independent Set.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007
Local Algorithms for Approximate Inference in MinorExcluded Graphs.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007
On queueing in coded networks  queue size follows degrees of freedom.
Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007
Adaptive Alternating Minimization Algorithms.
Proceedings of the IEEE International Symposium on Information Theory, 2007
Low Delay Scheduling in Wireless Network.
Proceedings of the IEEE International Symposium on Information Theory, 2007
Source Coding with Distortion through Graph Coloring.
Proceedings of the IEEE International Symposium on Information Theory, 2007
Network Coding in a Multicast Switch.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
Oblivious Routing with Mobile Fusion Centers over a Sensor Network.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
Iterative Scheduling Algorithms.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
Distributed Functional Compression through Graph Coloring.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007
Lower bounds for multistage vehicle routing.
Proceedings of the 46th IEEE Conference on Decision and Control, 2007
2006
Optimal ThroughputDelay Scaling in Wireless Networks  Part II: ConstantSize Packets.
IEEE Trans. Information Theory, 2006
Optimal throughputdelay scaling in wireless networks: part I: the fluid model.
IEEE Trans. Information Theory, 2006
Randomized gossip algorithms.
IEEE Trans. Information Theory, 2006
Maximizing throughput in wireless networks via gossiping.
Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006
Computing separable functions via gossip.
Proceedings of the TwentyFifth Annual ACM Symposium on Principles of Distributed Computing, 2006
Fast Gossip via Nonreversible Random Walk.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006
Information Dissemination via Network Coding.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
Uniform Multicommodity Flow in Wireless Networks with Gaussian Fading Channels.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
A Simpler MaxProduct Maximum Weight Matching Algorithm and the Auction Algorithm.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
Optimal Scheduling Algorithms for InputQueued Switches.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
Rateless Codes for the Gaussian Multiple Access Channel.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006
2005
Cell switching versus packet switching in inputqueued switches.
IEEE/ACM Trans. Netw., 2005
Throughputdelay scaling in wireless networks with constantsize packets.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
Maximum weight matching via maxproduct belief propagation.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
On the maximal throughput of networks with finite buffers and its application to buffered crossbars.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005
Gossip algorithms: design, analysis and applications.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005
Mixing Times for Random Walks on Geometric Random Graphs.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005
2004
Delay bounds for combined inputoutput switches with low speedup.
Perform. Eval., 2004
Throughput and delay in random wireless networks: 1D mobility is just as good as 2D.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
Throughputdelay tradeoff in energy constrained wireless networks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
ThroughputDelay Tradeoff in Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004
Fair scheduling in inputqueued switches under inadmissible traffic.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004
2003
Randomized scheduling algorithms for highaggregate bandwidth switches.
IEEE Journal on Selected Areas in Communications, 2003
Input Queued Switches: Cell Switching vs. Packet Switching.
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
Maximal matching scheduling is good enough.
Proceedings of the Global Telecommunications Conference, 2003
Switch Scheduling via Randomized Edge Coloring.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
2002
Maintaining Statistics Counters in Router Line Cards.
IEEE Micro, 2002
Efficient Randomized Algorithms for InputQueued Switch Scheduling.
IEEE Micro, 2002
Delay bounds for the approximate Maximum weight matching algorithm for input queued switches.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002
Towards Simple, Highperformance Schedulers for Highaggregate Bandwidth Switches.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002
Delay performance of highspeed packet switches with low speedup.
Proceedings of the Global Telecommunications Conference, 2002
Load Balancing with Memory.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
2001
Fast Updating Algorithms for TCAMs.
IEEE Micro, 2001
Analysis of a statistics counter architecture.
Proceedings of the Ninth Symposium on High Performance Interconnects, 2001
An efficient randomized algorithm for inputqueued switch scheduling.
Proceedings of the Ninth Symposium on High Performance Interconnects, 2001
An implementable parallel scheduler for inputqueued switches.
Proceedings of the Ninth Symposium on High Performance Interconnects, 2001
2000
Turbocharging Vertical Mining of Large Databases.
Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000
1999
Interestingness and Pruning of Mined Patterns.
Proceedings of the 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1999