The SCEAS System
| |||||||

## Search the dblp DataBase
Erik Vee:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Paul Beame, Erik Vee
**Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:18- [Conf] - David Liben-Nowell, Erik Vee, An Zhu
**Finding Longest Increasing and Common Subsequences in Streaming Data.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:263-272 [Conf] - Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
**Super-linear time-space tradeoff lower bounds for randomized computation.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:169-179 [Conf] - Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
**Towards Secure and Scalable Computation in Peer-to-Peer Networks.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:87-98 [Conf] - Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
**Comparing and Aggregating Rankings with Ties.**[Citation Graph (0, 0)][DBLP] PODS, 2004, pp:47-58 [Conf] - T. S. Jayram, Phokion G. Kolaitis, Erik Vee
**The containment problem for REAL conjunctive queries with inequalities.**[Citation Graph (0, 0)][DBLP] PODS, 2006, pp:80-89 [Conf] - Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
**Scalable leader election.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:990-999 [Conf] - Paul Beame, Erik Vee
**Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:688-697 [Conf] - Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
**Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:25, pp:- [Journal] - Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
**Time-space trade-off lower bounds for randomized computation of decision problems.**[Citation Graph (0, 0)][DBLP] J. ACM, 2003, v:50, n:2, pp:154-195 [Journal] - David Liben-Nowell, Erik Vee, An Zhu
**Finding longest increasing and common subsequences in streaming data.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:11, n:2, pp:155-175 [Journal] - T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
**Estimating statistical aggregates on probabilistic data streams.**[Citation Graph (0, 0)][DBLP] PODS, 2007, pp:243-252 [Conf] - T. S. Jayram, Satyen Kale, Erik Vee
**Efficient aggregation algorithms for probabilistic data.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:346-355 [Conf] **Efficient Computation of Diverse Query Results.**[Citation Graph (, )][DBLP]**Balanced allocation with succinct representation.**[Citation Graph (, )][DBLP]**Optimal online assignment with forecasts.**[Citation Graph (, )][DBLP]**Efficient bulk insertion into a distributed ordered table.**[Citation Graph (, )][DBLP]**Forecasting high-dimensional data.**[Citation Graph (, )][DBLP]**Efficiently evaluating complex boolean expressions.**[Citation Graph (, )][DBLP]**Cost of Conciseness in Sponsored Search Auctions.**[Citation Graph (, )][DBLP]**Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm.**[Citation Graph (, )][DBLP]**Connectivity structure of bipartite graphs via the KNC-plot.**[Citation Graph (, )][DBLP]**Floodlight illumination of infinite wedges.**[Citation Graph (, )][DBLP]**Inventory Allocation for Online Graphical Display Advertising**[Citation Graph (, )][DBLP]**Efficient Computation of Diverse Query Results.**[Citation Graph (, )][DBLP]
Search in 0.040secs, Finished in 0.042secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |