World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
14145
World Ranking
9955
National Ranking
4187

Overview

Mark S. Manasse is a researcher affiliated with Microsoft in the United States. Their work focuses primarily on higher education practices and engagement, contributing to the field of education. Manasse has published in venues related to academic support programs, emphasizing the support structures for college students.

Their recent publications include the following papers:

  • Supporting Online Community College Students With Trained Tutors in a Post-COVID World, 2022, Journal of College Academic Support Programs
  • Journal of College Academic Support Programs, 2022, Journal of College Academic Support Programs

Manasse frequently collaborates with other researchers in related fields. Notable coauthors include:

  • Jennifer Baldauf
  • Carol W. Dochen
  • th Anniversary
  • Laurie A. Sharp
  • Jonathan Lollar

Their publications are primarily found in the Journal of College Academic Support Programs, indicating a focused interest in the dissemination of research through this venue.

Manasse's main academic focus can be categorized under:

  • Education (subfield)

Their research topics cover:

  • Higher Education Practices and Engagement

Best Publications

  • Syntactic clustering of the Web

    Andrei Z. Broder;Steven C. Glassman;Mark S. Manasse;Geoffrey Zweig

  • Design tradeoffs for SSD performance

    Nitin Agrawal;Vijayan Prabhakaran;Ted Wobber;John D. Davis

  • Competitive snoopy caching

    Anna R. Karlin;Mark S. Manasse;Larry Rudolph;Daniel D. Sleator

  • Competitive algorithms for server problems

    Mark S. Manasse;Lyle A. McGeoch;Daniel D. Sleator

  • Detecting spam web pages through content analysis

    Alexandros Ntoulas;Marc Najork;Mark Manasse;Dennis Fetterly

  • A large-scale study of the evolution of web pages

    Dennis Fetterly;Mark Manasse;Marc Najork;Janet L. Wiener

  • Competitive algorithms for on-line problems

    Mark Manasse;Lyle McGeoch;Daniel Sleator

  • Competitive randomized algorithms for nonuniform problems

    A. R. Karlin;M. S. Manasse;L. A. Mcgeoch;S. Owicki

  • A large-scale study of the evolution of web pages

    Dennis Fetterly;Mark Manasse;Marc Najork;Janet Wiener

  • Spam, damn spam, and statistics: using statistical analysis to locate spam web pages

    Dennis Fetterly;Mark Manasse;Marc Najork

  • The number field sieve

    A. K. Lenstra;H. W. Lenstra;M. S. Manasse;J. M. Pollard

  • Moderately hard, memory-bound functions

    Martin Abadi;Mike Burrows;Mark Manasse;Ted Wobber

  • Method for clustering closely resembling data objects

    Andrei Z. Broder;Steven C. Glassman;Charles G. Nelson;Mark S. Manasse

  • The MilliCent Protocol for Inexpensive Electronic Commerce

    Steven C. Glassman;Mark S. Manasse;Martín Abadi;Paul Gauthier

  • Method and apparatus for conducting computerized commerce

    Mark S. Manasse

  • On the evolution of clusters of near-duplicate Web pages

    D. Fetterly;M. Manasse;M. Najork

  • Empirical studies of competitve spinning for a shared-memory multiprocessor

    Anna R. Karlin;Kai Li;Mark S. Manasse;Susan Owicki

  • Generic copies of countable structures

    Christopher J. Ash;Julia F. Knight;Mark S. Manasse;Theodore A. Slaman

  • The factorization of the ninth Fermat number

    A. K. Lenstra;H. W. Lenstra;M. S. Manasse;J. M. Pollard

  • The millicent protocols for electronic commerce

    Mark S. Manasse

  • Detecting phrase-level duplication on the world wide web

    Dennis Fetterly;Mark Manasse;Marc Najork

Frequent Co-Authors

Marc Najork
Marc Najork Google (United States)
Arjen K. Lenstra
Arjen K. Lenstra École Polytechnique Fédérale de Lausanne
Kunal Talwar
Kunal Talwar Apple (United States)
Karin Strauss
Karin Strauss Microsoft (United States)
Sergey Yekhanin
Sergey Yekhanin Microsoft (United States)
Frank McSherry
Frank McSherry Materialize, Inc.
Anna R. Karlin
Anna R. Karlin University of Washington
Martín Abadi
Martín Abadi Google (United States)
Daniel D. Sleator
Daniel D. Sleator Carnegie Mellon University
Chandramohan A. Thekkath
Chandramohan A. Thekkath Microsoft (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Computer Science is a versatile field with numerous related online degree options, allowing you to find a path that matches your interests and career goals. For those seeking a quicker entry point, exploring what's the easiest associate's degree to get can be beneficial—associate programs offer foundational skills and are often completed in just two years.

If you’re aiming for senior leadership positions, consider advanced credentials such as a doctorate. Researching the cheapest online doctorate in educational leadership can help you achieve your goals without excessive debt.

No matter which degree program you choose, it’s crucial to verify accreditation. Pursuing online degree programs accredited by respected institutions ensures your qualification will be recognized by employers.

Interested in blending creativity with tech skills? Options like video game programs can launch a career in the booming gaming industry. Whatever your ambitions, online degree pathways in Computer Science offer flexibility and real opportunities for growth.

Best Scientists Citing Mark S. Manasse

Trending Scientists