Mark S. Manasse

According to our database1, Mark S. Manasse authored at least 38 papers between 1982 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Ski Rental Problem.
Encyclopedia of Algorithms, 2016

2015
On the Efficient Determination of Most Near Neighbors: Horseshoes, Hand Grenades, Web Search and Other Situations When Close is Close Enough, Second Edition
Synthesis Lectures on Information Concepts, Retrieval, and Services, Morgan & Claypool Publishers, 2015

2014
Consistent Weighted Sampling Made Fast, Small, and Easy.
CoRR, 2014

2013
Zombie memory: extending memory lifetime by reviving dead blocks.
Proceedings of the 40th Annual International Symposium on Computer Architecture, 2013

Duplicate News Story Detection Revisited.
Proceedings of the Information Retrieval Technology, 2013

2012
On the Efficient Determination of Most Near Neighbors: Horseshoes, Hand Grenades, Web Search and Other Situations When Close is Close Enough
Synthesis Lectures on Information Concepts, Retrieval, and Services, Morgan & Claypool Publishers, 2012

2008
Ski Rental Problem.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Design Tradeoffs for SSD Performance.
Proceedings of the 2008 USENIX Annual Technical Conference, 2008

2006
Report on the 7th Workshop on Distributed Data and Structures: (WDAS 2006).
SIGMOD Record, 2006

Detecting spam web pages through content analysis.
Proceedings of the 15th international conference on World Wide Web, 2006

2005
Moderately hard, memory-bound functions.
ACM Trans. Internet Techn., 2005

Detecting phrase-level duplication on the world wide web.
Proceedings of the SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2005

2004
A large-scale study of the evolution of Web pages.
Softw., Pract. Exper., 2004

On The Evolution of Clusters of Near-Duplicate Web Pages.
J. Web Eng., 2004

Spam, Damn Spam, and Statistics: Using Statistical Analysis to Locate Spam Web Pages.
Proceedings of the Seventh International Workshop on the Web and Databases, 2004

1999
Y10K and Beyond.
RFC, April, 1999

1997
Syntactic Clustering of the Web.
Comput. Networks, 1997

1996
The Millicent Protocol for Inexpensive Electronic Commerce.
World Wide Web Journal, 1996

1995
The Millicent Protocols for Electronic Commerce.
Proceedings of the First USENIX Workshop on Electronic Commerce, 1995

Argohalls: Adding Support for Group Awareness to the Argo Telecollaboration System.
Proceedings of the 8th Annual ACM Symposium on User Interface Software and Technology, 1995

Pssst: Side Conversations in the Argo Telecollaboration System.
Proceedings of the 8th Annual ACM Symposium on User Interface Software and Technology, 1995

1994
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems.
J. ACM, 1994

Competitive Randomized Algorithms for Nonuniform Problems.
Algorithmica, 1994

Argo: A System for Distributed Collaboration.
Proceedings of the Second ACM International Conference on Multimedia '94, 1994

Adding Digital Video to an Object-Oriented User Interface Toolkit.
Proceedings of the Object-Oriented Programming, Proceedings of the 8th European Conference, 1994

1993
On-line Choice of On-line Algorithms.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

On the Factorization of RSA-120.
Proceedings of the Advances in Cryptology, 1993

1991
Empirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor.
Proceedings of the Thirteenth ACM Symposium on Operating System Principles, 1991

1990
Why X Is Not Our Ideal Window System
Softw., Pract. Exper., 1990

Competitive Algorithms for Server Problems.
J. Algorithms, 1990

The Number Field Sieve
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Competitive Randomized Algorithms for Non-Uniform Problems.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Factoring With Two Large Primes.
Proceedings of the Advances in Cryptology, 1990

1989
Generic Copies of Countable Structures.
Ann. Pure Appl. Log., 1989

Factoring by Electronic Mail.
Proceedings of the Advances in Cryptology, 1989

1988
Competitive Snoopy Caching.
Algorithmica, 1988

Competitive Algorithms for On-line Problems
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1982
Propositional & analogical generation of coordinated verbal, visual & musical texts: U. of Wisconsin.
SIGART Newsletter, 1982


  Loading...