# Qiqi Yan

According to our database

Collaborative distances:

^{1}, Qiqi Yan authored at least 31 papers between 2006 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

How Important is a Neuron.

Proceedings of the 7th International Conference on Learning Representations, 2019

2018

How Important Is a Neuron?

CoRR, 2018

The Cascading Analysts Algorithm.

Proceedings of the 2018 International Conference on Management of Data, 2018

2017

A Simple and Efficient MapReduce Algorithm for Data Cube Materialization.

CoRR, 2017

Axiomatic Attribution for Deep Networks.

CoRR, 2017

Hierarchical Summarization of Metric Changes.

CoRR, 2017

Analyza: Exploring Data with Conversation.

Proceedings of the 22nd International Conference on Intelligent User Interfaces, 2017

Axiomatic Attribution for Deep Networks.

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders.

ACM Trans. Economics and Comput., 2016

Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.

J. ACM, 2016

Gradients of Counterfactuals.

CoRR, 2016

2015

Envy freedom and prior-free mechanism design.

J. Economic Theory, 2015

Revenue maximization with a single sample.

Games and Economic Behavior, 2015

2013

Whole-page optimization and submodular welfare maximization with online bidders.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Envy Freedom and Prior-free Mechanism Design

CoRR, 2012

Supply-limiting mechanisms.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011

An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries

CoRR, 2011

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders

CoRR, 2011

Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

From convex optimization to randomized mechanisms: toward optimal combinatorial auctions.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Mechanism Design via Correlation Gap.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Envy, truth, and profit.

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010

Mechanism Design via Correlation Gap

CoRR, 2010

Robust Mechanisms for Risk-Averse Sellers

CoRR, 2010

Robust mechanisms for risk-averse sellers.

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Revenue maximization with a single sample.

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

2008

Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique.

Logical Methods in Computer Science, 2008

Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique

CoRR, 2008

2007

Classifying regular languages by a split game.

Theor. Comput. Sci., 2007

On the Price of Truthfulness in Path Auctions.

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006

Lower Bounds for Complementation of

*omega*-Automata Via the Full Automata Technique.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006