Computing dominances inEn (short communication)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing dominances inEn (short communication)

Source

Information Processing Letters archive
Volume 38 , Issue 5 (June 1991) table of contents

Pages: 277 - 278

Year of Publication: 1991

ISSN:0020-0190

Author

Jiří Matoušek

Publisher

Elsevier North-Holland, Inc. Amsterdam, The Netherlands, The Netherlands

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 16

Additional Information:

cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	10.1016/0020-0190(91)90071-O

CITED BY 16

	Dimitris Papadias , Yufei Tao , Greg Fu , Bernhard Seeger, An optimal and progressive algorithm for skyline queries, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California
	Boaz Ben-Moshe , Paz Carmi , Matthew J. Katz, Computing all large sums-of-pairs in Rⁿ and the discrete planar two-watchtower problem, Information Processing Letters, v.89 n.3, p.137-139, 14 February 2004
	Pin-Kwang Eng , Beng Chin Ooi , Kian-Lee Tan, Indexing for progressive skyline computation, Data & Knowledge Engineering, v.46 n.2, p.169-201, August 2003
	Chee-Yong Chan , Pin-Kwang Eng , Kian-Lee Tan, Stratified computation of skylines with partially-ordered domains, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland
	Dimitris Papadias , Yufei Tao , Greg Fu , Bernhard Seeger, Progressive skyline computation in database systems, ACM Transactions on Database Systems (TODS), v.30 n.1, p.41-82, March 2005
	Jian Pei , Wen Jin , Martin Ester , Yufei Tao, Catching the best views of skyline: a semantic approach based on decisive subspaces, Proceedings of the 31st international conference on Very large data bases, August 30-September 02, 2005, Trondheim, Norway
	Eric Lo , Kevin Y. Yip , King-Ip Lin , David W. Cheung, Progressive skylining over web-accessible databases, Data & Knowledge Engineering, v.57 n.2, p.122-147, May 2006
	Virginia Vassilevska , Ryan Williams, Finding a maximum weight triangle in n^3-Δ time, with applications, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Donald Kossmann , Frank Ramsak , Steffen Rost, Shooting stars in the sky: an online algorithm for skyline queries, Proceedings of the 28th international conference on Very Large Data Bases, p.275-286, August 20-23, 2002, Hong Kong, China
	Virginia Vassilevska , Ryan Williams , Raphael Yuster, All-pairs bottleneck paths for general graphs in truly sub-cubic time, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	M. Morse , J. M. Patel , W. I. Grosky, Efficient continuous skyline computation, Information Sciences: an International Journal, v.177 n.17, p.3411-3437, September, 2007
	Cuiping Li , Anthony K. H. Tung , Wen Jin , Martin Ester, On dominating your neighborhood profitably, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
	Kian-Lee Tan , Pin-Kwang Eng , Beng Chin Ooi, Efficient Progressive Skyline Computation, Proceedings of the 27th International Conference on Very Large Data Bases, p.301-310, September 11-14, 2001
	Ran Duan , Seth Pettie, Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.384-391, January 04-06, 2009, New York, New York
	Virginia Vassilevska, Nondecreasing paths in a weighted graph or: how to optimally read a train schedule, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, p.465-472, January 20-22, 2008, San Francisco, California
	Raphael Yuster, Efficient algorithms on sets of permutations, dominance, and real-weighted APSP, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.950-957, January 04-06, 2009, New York, New York