Citation Impact
Citing Papers
Boosting with Maximum Adaptive Sampling
2011
Computational Complexity: A Modern Approach
2009
Making routers last longer with ViAggre
2009
Sparse Subspace Clustering: Algorithm, Theory, and Applications
2013 Standout
The backtracking survey propagation algorithm for solving random K-SAT problems
2016 StandoutNobel
Bayesian Neural Networks for Internet Traffic Classification
2007
Robust Face Recognition via Sparse Representation
2009 Standout
Cosmic Bell Test Using Random Measurement Settings from High-Redshift Quasars
2018 StandoutNobel
Software-Defined Networking: A Comprehensive Survey
2014 Standout
Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art
2002 Standout
A theory of goal-oriented communication
2012
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
1998
Providing public intradomain traffic matrices to the research community
2006
Clique is hard to approximate within n1−ε
1999
Efficiency and Braess' Paradox under pricing in general networks
2006 StandoutNobel
Two-Prover Protocols---Low Error at Affordable Rates
2000
Improved decoding of Reed-Solomon and algebraic-geometry codes
1999 Standout
A threshold of ln n for approximating set cover
1998 Standout
A privacy threat analysis framework: supporting the elicitation and fulfillment of privacy requirements
2010 Standout
Scalable tensor factorizations for incomplete data
2010 Standout
A survey of techniques for internet traffic classification using machine learning
2008 Standout
Quantum Arthur–Merlin games
2005
Big Data: Survey, Technologies, Opportunities, and Challenges
2014 Standout
Maximum pseudo likelihood estimation in network tomography
2003
EEG Emotion Recognition Using Dynamical Graph Convolutional Neural Networks
2018 Standout
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
2013 Standout
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
1997
Highly resilient correctors for polynomials
1992
Interactive proofs and the hardness of approximating cliques
1996
Graph clustering
2007 Standout
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
2006
Expander graphs and their applications
2006
Communication Complexity and Secure Function Evaluation
2001
Personnel scheduling: A literature review
2012 Standout
A Survey on Software-Defined Networking
2014 Standout
Rethinking virtual network embedding
2008
Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age
2016 Standout
Mobile edge computing, Fog et al.: A survey and analysis of security threats and challenges
2016 Standout
The rise of “big data” on cloud computing: Review and open research issues
2014 Standout
Approximating the Cut-Norm via Grothendieck's Inequality
2006
List Decoding of Error-Correcting Codes
2005
An Overview of IP Flow-Based Intrusion Detection
2010
False data injection attacks against state estimation in electric power grids
2011 Standout
Cognitive radio networking and communications: an overview
2011 Standout
Probabilistic checking of proofs
1998
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
2011 Standout
Mining anomalies using traffic feature distributions
2005
Bell nonlocality
2014 Standout
Traffic theory and the Internet
2001
A comprehensive review of firefly algorithms
2013 Standout
Human-level performance in 3D multiplayer games with population-based reinforcement learning
2019 StandoutScienceNobel
Using error decay prediction to overcome practical issues of deep active learning for named entity recognition
2020
Theory of Simple Glasses: Exact Solutions in Infinite Dimensions
2020 StandoutNobel
The Nature of Computation
2011
Internet tomography
2002
Delayed-choice gedanken experiments and their realizations
2016 StandoutNobel
Zero Knowledge and the Chromatic Number
1998
DDoS Attacks at the Application Layer: Challenges and Research Perspectives for Safeguarding Web Applications
2018 Standout
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
2019 Standout
Entangled Games Are Hard to Approximate
2011
The Capacitated K-Center Problem
2000
A survey of network anomaly detection techniques
2015 Standout
Simplifying the synthesis of internet traffic matrices
2005
Massively parallel probabilistic computing with sparse Ising machines
2022 StandoutNobel
A Survey of Deep Active Learning
2021 Standout
Graph Coloring with Adaptive Evolutionary Algorithms
1998
What is Semantic Communication? A View on Conveying Meaning in the Era of Machine Intelligence
2021 Standout
On the power of multi-prover interactive protocols
1994
The Complexity of Decentralized Control of Markov Decision Processes
2013
Critical infrastructure protection: Resource efficient sampling to improve detection of less frequent patterns in network traffic
2010
The Internet Topology Zoo
2011 Standout
LightGBM: A Highly Efficient Gradient Boosting Decision Tree
2017 Standout
Security and Privacy in Cloud Computing
2012
Traffic matrix estimation
2002
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
2008 Standout
Unique Games with Entangled Provers Are Easy
2010
Private information retrieval
1998
Entanglement detection
2009 Standout
Latency Critical IoT Applications in 5G: Perspective on the Design of Radio Interface and Network Architecture
2017 Standout
PSPACE has constant-round quantum interactive proof systems
2003
Detecting HTTP-based application layer DoS attacks on web servers in the presence of sampling
2017
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
2006
A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection
2015 Standout
Virtual Network Embedding: A Survey
2013 Standout
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization
2011
A review of novelty detection
2014 Standout
Most Tensor Problems Are NP-Hard
2013 Standout
On the severity of Braess's Paradox: Designing networks for selfish users is hard
2006
Data Streams: Algorithms and Applications
2005
Monitoring abnormal network traffic based on blind source separation approach
2011
Works of Carsten Lund being referenced
Deriving traffic demands for operational IP networks: methodology and experience
2001
NetScope: traffic engineering for IP networks
2000
Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach
2005
Non-deterministic exponential time has two-prover interactive protocols
1992
On the hardness of approximating minimization problems
1994
Priority sampling for estimation of arbitrary subset sums
2007
Learn More, Sample Less: Control of Volume and Variance in Network Measurement
2005
On the hardness of computing the permanent of random matrices
1996
Non-deterministic exponential time has two-prover interactive protocols
1991
Deriving traffic demands for operational IP networks
2000
Flow sampling under hard resource constraints
2004
Algebraic methods for interactive proof systems
1992
Proof verification and the hardness of approximation problems
1998