Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark S. Manasse
Person information
- affiliation: Microsoft Research, Mountain View, CA, USA
- affiliation: Compaq Computer Corporation, Palo Alto, CA, USA
- affiliation: DEC Systems Research Center, Palo Alto, CA
- affiliation: University of Chicago, Department of Computer Science, IL, USA
- affiliation: University of Wisconsin, Mathematics Department, Madison, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b2]Mark S. Manasse
:
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, ISBN 978-3-031-01168-9- 2012
- [b1]Mark S. Manasse:
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, ISBN 978-3-031-01168-9
Journal Articles
- 2006
- [j13]Thomas Schwarz, Mark S. Manasse:
Report on the 7th Workshop on Distributed Data and Structures: (WDAS 2006). SIGMOD Rec. 35(2): 53-55 (2006) - 2005
- [j12]Martín Abadi, Michael Burrows, Mark S. Manasse, Ted Wobber:
Moderately hard, memory-bound functions. ACM Trans. Internet Techn. 5(2): 299-327 (2005) - 2004
- [j11]Dennis Fetterly, Mark S. Manasse, Marc Najork:
On The Evolution of Clusters of Near-Duplicate Web Pages. J. Web Eng. 2(4): 228-246 (2004) - [j10]Dennis Fetterly, Mark S. Manasse, Marc Najork, Janet L. Wiener:
A large-scale study of the evolution of Web pages. Softw. Pract. Exp. 34(2): 213-237 (2004) - 1997
- [j9]Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, Geoffrey Zweig:
Syntactic Clustering of the Web. Comput. Networks 29(8-13): 1157-1166 (1997) - 1996
- [j8]Steven C. Glassman, Mark S. Manasse, Martín Abadi, Paul Gauthier, Patrick Sobalvarro:
The Millicent Protocol for Inexpensive Electronic Commerce. World Wide Web J. 1(1) (1996) - 1994
- [j7]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Nonuniform Problems. Algorithmica 11(6): 542-571 (1994) - [j6]Peter K. Rathmann, Marianne Winslett, Mark S. Manasse:
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems. J. ACM 41(5): 819-873 (1994) - 1990
- [j5]Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for Server Problems. J. Algorithms 11(2): 208-230 (1990) - [j4]Hania Gajewska, Mark S. Manasse, Joel McCormack:
Why X Is Not Our Ideal Window System. Softw. Pract. Exp. 20(S2): S2/137-S2/171 (1990) - 1989
- [j3]Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman:
Generic Copies of Countable Structures. Ann. Pure Appl. Log. 42(3): 195-205 (1989) - 1988
- [j2]Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching. Algorithmica 3: 77-119 (1988) - 1982
- [j1]Sheldon Klein, David A. Ross, Mark S. Manasse, Johanna Danos, Mark Bickford, Kendall Jensen, Walter A. Burt, Glenn D. Blank, Walter T. Blanks:
Propositional & analogical generation of coordinated verbal, visual & musical texts: U. of Wisconsin. SIGART Newsl. 79: 104 (1982)
Conference and Workshop Papers
- 2013
- [c23]Omar Alonso, Dennis Fetterly, Mark S. Manasse:
Duplicate News Story Detection Revisited. AIRS 2013: 203-214 - [c22]Rodolfo Azevedo, John D. Davis, Karin Strauss, Parikshit Gopalan, Mark S. Manasse, Sergey Yekhanin:
Zombie memory: extending memory lifetime by reviving dead blocks. ISCA 2013: 452-463 - 2008
- [c21]Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark S. Manasse, Rina Panigrahy:
Design Tradeoffs for SSD Performance. USENIX ATC 2008: 57-70 - 2006
- [c20]Alexandros Ntoulas, Marc Najork, Mark S. Manasse, Dennis Fetterly:
Detecting spam web pages through content analysis. WWW 2006: 83-92 - 2005
- [c19]Dennis Fetterly, Mark S. Manasse, Marc Najork:
Detecting phrase-level duplication on the world wide web. SIGIR 2005: 170-177 - 2004
- [c18]Dennis Fetterly, Mark S. Manasse, Marc Najork:
Spam, Damn Spam, and Statistics: Using Statistical Analysis to Locate Spam Web Pages. WebDB 2004: 1-6 - 2003
- [c17]Dennis Fetterly, Mark S. Manasse, Marc Najork:
On the Evolution of Clusters of Near-Duplicate Web Pages. LA-WEB 2003: 37-45 - [c16]Dennis Fetterly, Mark S. Manasse, Marc Najork, Janet L. Wiener:
A large-scale study of the evolution of web pages. WWW 2003: 669-678 - 1995
- [c15]Lance Berc, Hania Gajewska, Mark S. Manasse:
Pssst: Side Conversations in the Argo Telecollaboration System. ACM Symposium on User Interface Software and Technology 1995: 155-156 - [c14]Hania Gajewska, Mark S. Manasse, David D. Redell:
Argohalls: Adding Support for Group Awareness to the Argo Telecollaboration System. ACM Symposium on User Interface Software and Technology 1995: 157-158 - [c13]Mark S. Manasse:
The Millicent Protocols for Electronic Commerce. USENIX Workshop on Electronic Commerce 1995 - [c12]Steven C. Glassman, Mark S. Manasse, Martín Abadi, Paul Gauthier, Patrick Sobalvarro:
The Millicent Protocol for Inexpensive Electronic Commerce. WWW (Fall) 1995: 603-618 - 1994
- [c11]Stephen Martin Guy Freeman, Mark S. Manasse:
Adding Digital Video to an Object-Oriented User Interface Toolkit. ECOOP 1994: 493-512 - [c10]Hania Gajewska, James J. Kistler, Mark S. Manasse, David D. Redell:
Argo: A System for Distributed Collaboration. ACM Multimedia 1994: 433-440 - 1993
- [c9]Thomas F. Denny, Bruce Dodson, Arjen K. Lenstra, Mark S. Manasse:
On the Factorization of RSA-120. CRYPTO 1993: 166-174 - [c8]Yossi Azar, Andrei Z. Broder, Mark S. Manasse:
On-line Choice of On-line Algorithms. SODA 1993: 432-440 - 1991
- [c7]Anna R. Karlin, Kai Li, Mark S. Manasse, Susan S. Owicki:
Empirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor. SOSP 1991: 41-55 - 1990
- [c6]Arjen K. Lenstra, Mark S. Manasse:
Factoring With Two Large Primes. EUROCRYPT 1990: 72-82 - [c5]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Non-Uniform Problems. SODA 1990: 301-309 - [c4]Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard:
The Number Field Sieve. STOC 1990: 564-572 - 1989
- [c3]Arjen K. Lenstra, Mark S. Manasse:
Factoring by Electronic Mail. EUROCRYPT 1989: 355-371 - 1988
- [c2]Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for On-line Problems. STOC 1988: 322-333 - 1986
- [c1]Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching. FOCS 1986: 244-254
Reference Works
- 2016
- [r2]Mark S. Manasse:
Ski Rental Problem. Encyclopedia of Algorithms 2016: 1999-2002 - 2008
- [r1]Mark S. Manasse:
Ski Rental Problem. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2014
- [i2]Bernhard Haeupler, Mark S. Manasse, Kunal Talwar:
Consistent Weighted Sampling Made Fast, Small, and Easy. CoRR abs/1410.4266 (2014) - 1999
- [i1]Steven C. Glassman, Mark S. Manasse, Jeffrey C. Mogul:
Y10K and Beyond. RFC 2550: 1-14 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
