Erik Vee

According to our database1, Erik Vee authored at least 42 papers between 2000 and 2016.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
An Algorithmic View of Voting.
SIAM J. Discrete Math., 2016

2015
Traffic Shaping to Optimize Ad Delivery.
ACM Trans. Economics and Comput., 2015

Inverting a Steady-State.
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

2012
SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising
CoRR, 2012

Ad Serving Using a Compact Allocation Plan
CoRR, 2012

Ad serving using a compact allocation plan.
Proceedings of the ACM Conference on Electronic Commerce, 2012

Traffic shaping to optimize ad delivery.
Proceedings of the ACM Conference on Electronic Commerce, 2012

SHALE: an efficient algorithm for allocation of guaranteed display advertising.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Inventory Allocation for Online Graphical Display Advertising using Multi-objective Optimization.
Proceedings of the ICORES 2012, 2012

2011
The Multiple Attribution Problem in Pay-Per-Conversion Advertising.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010
Inventory Allocation for Online Graphical Display Advertising
CoRR, 2010

Floodlight illumination of infinite wedges.
Comput. Geom., 2010

Efficiently evaluating complex boolean expressions.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Forecasting high-dimensional data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Optimal online assignment with forecasts.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Balanced allocation with succinct representation.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

Pricing guaranteed contracts in online display advertising.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Stream Similarity Mining.
Proceedings of the Encyclopedia of Database Systems, 2009

Indexing Boolean Expressions.
PVLDB, 2009

Efficient Computation of Diverse Query Results.
IEEE Data Eng. Bull., 2009

2008
Estimating statistical aggregates on probabilistic data streams.
ACM Trans. Database Syst., 2008

Scalable ranked publish/subscribe.
PVLDB, 2008

Efficient top-k processing over query-dependent functions.
PVLDB, 2008

Connectivity structure of bipartite graphs via the KNC-plot.
Proceedings of the International Conference on Web Search and Web Data Mining, 2008

Efficient bulk insertion into a distributed ordered table.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Efficient Computation of Diverse Query Results.
Proceedings of the 24th International Conference on Data Engineering, 2008

2007
Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Cost of Conciseness in Sponsored Search Auctions.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Efficient aggregation algorithms for probabilistic data.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Estimating statistical aggregates on probabilistic data streams.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

2006
Comparing Partial Rankings.
SIAM J. Discrete Math., 2006

Finding longest increasing and common subsequences in streaming data.
J. Comb. Optim., 2006

Scalable leader election.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

The containment problem for REAL conjunctive queries with inequalities.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Towards Secure and Scalable Computation in Peer-to-Peer Networks.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Finding Longest Increasing and Common Subsequences in Streaming Data.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Comparing and Aggregating Rankings with Ties.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

2003
Time-space trade-off lower bounds for randomized computation of decision problems.
J. ACM, 2003

2002
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2000
Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation
Electronic Colloquium on Computational Complexity (ECCC), 2000

Super-linear time-space tradeoff lower bounds for randomized computation.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000


  Loading...