
Online Influence Maximization with Nodelevel Feedback Using Standard Offline Oracles
We study the online influence maximization (OIM) problem in social netwo...
read it

Perfect Sampling for (Atomic) Lovász Local Lemma
We give a Markov chain based perfect sampler for uniform sampling soluti...
read it

Network Inference and Influence Maximization from Samples
Influence maximization is the task of selecting a small number of seed n...
read it

Quantum Search with Prior Knowledge
Searchbase algorithms have widespread applications in different scenari...
read it

Discouraging Pool Block Withholding Attacks in Bitcoins
The arisen of Bitcoin has led to much enthusiasm for blockchain research...
read it

Optimization from Structured Samples for Coverage Functions
We revisit the optimization from samples (OPS) model, which studies the ...
read it

Tight Algorithms for the Submodular Multiple Knapsack Problem
Submodular function maximization has been a central topic in the theoret...
read it

Hybrid Decision Trees: Longer Quantum Time is Strictly More Powerful
In this paper, we introduce the hybrid query complexity, denoted as Q(f;...
read it

On the Degree of Boolean Functions as Polynomials over Z_m
Polynomial representations of Boolean functions over various rings such ...
read it

A Quantuminspired Classical Algorithm for Separable Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) asks to decompose a (entrywise)...
read it

Optimal SpaceDepth TradeOff of CNOT Circuits in Quantum Logic Synthesis
Due to the decoherence of the stateoftheart physical implementations ...
read it

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
The classical cake cutting problem studies how to find fair allocations ...
read it

Querying a Matrix through MatrixVector Products
We consider algorithms with access to an unknown matrix M∈F^n × d via ma...
read it

Dynamic MCMC Sampling
The Markov chain Monte Carlo (MCMC) methods are the primary tools for sa...
read it

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
In the 1970's, Lovász built a bridge between graphs and alternating matr...
read it

On the Relationship between Energy Complexity and Other Boolean Function Measures
In this work we investigate into energy complexity, a Boolean function m...
read it

Coreness of Cooperative Games with Truncated Submodular Profit Functions
Coreness represents solution concepts related to core in cooperative gam...
read it

A direct approach to false discovery rates by decoy permutations
The current approaches to false discovery rates (FDRs) in multiple hypot...
read it

Quantum Lovász Local Lemma: Shearer's Bound is Tight
Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and pr...
read it

Higher order monotonicity and submodularity of influence in social networks: from local to global
Kempe, Kleinberg and Tardos (KKT) proposed the following conjecture abou...
read it

Exact quantum query complexity of weight decision problems
The weight decision problem, which requires to determine the Hamming wei...
read it

On the Decision Tree Complexity of String Matching
String matching is one of the most fundamental problems in computer scie...
read it

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising
In this work, we study the guaranteed delivery model which is widely use...
read it

Randomized Mechanisms for Selling Reserved Instances in Cloud
Selling reserved instances (or virtual machines) is a basic service in c...
read it

Conquering the rating bound problem in neighborhoodbased collaborative filtering: a function recovery approach
As an important tool for information filtering in the era of socialized ...
read it
Xiaoming Sun
is this you? claim profile