Mark S Manasse

Followers

Following

Co-author

Mentions

Public Views

PhD Matematical Logic, research in algorithms, cryptography, security, systems, distributed computing, on-line algorithms, and more. Worked at Bell Labs, DEC, Microsoft, and Salesforce. Taught at University of Chicago. Board member and CTO/Chief Scientist of Silverwyn.

less

Ali Ahmed

University of Liverpool online programme with Laureate

Bilami Azeddine

El-Hadj Lakhdar

Remo Caponi

University of Cologne

Armando Marques-Guedes

UNL - New University of Lisbon

Dr. Gulshan Shrivastava

Galgotias University,Greater Noida

Dr. Wesam S Bhaya

University of Babylon

Sanjit Setua

University of Calcutta

Gerassimos Barlas

American University of Sharjah

Journal of Computer Science IJCSIS

Eoghan Casey

University of Lausanne

Interests

Uploads

Papers by Mark S Manasse

Session details: E-commerce & e-government

Forks in the Road: Flajolet and Slightly Biased Sampling

Springer eBooks, 2015

Session details: Trustworthy Web sites

The Web Conference, May 10, 2005

The trestle toolkit

The X Resource archive, 1993

The number field sieve

Download

Comparing Web Pages for Similarity: An Overview

Springer eBooks, 2015

On the Efficient Determination of Most Near Neighbors

Springer eBooks, 2015

Download

Addendum: The Factorization of the Ninth Fermat Number

Mathematics of Computation, Jul 1, 1995

In this paper we exhibit the full prime factorization of the ninth Fermat number Fg = 2512 + 1. I... more In this paper we exhibit the full prime factorization of the ninth Fermat number Fg = 2512 + 1. It is the product of three prime factors that have 7, 49, and 99 decimal digits. We found the two largest prime factors by means of the number field sieve, which is a factoring algorithm that depends on arithmetic in an algebraic number field. In the present case, the number field used was Q(-. The calculations were done on approximately 700 workstations scattered around the world, and in one of the final stages a supercomputer was used. The entire factorization took four months.

Download

Report on the 7 <sup>th</sup> Workshop on Distributed Data and Structures

Sigmod Record, Jun 1, 2006

Competitive randomized algorithms for non-uniform problems

Symposium on Discrete Algorithms, 1990

Download

COMPETITIVE SNOOPY CACHING11A preliminary version of this paper appeared in the Proceedings of the 27th Annual Symposium on the Foundations of Computer Science, IEEE, Toronto, Canada, 1986. A version of this paper containing all proofs and some further results will appear in Algorithmica

Elsevier eBooks, 1987

In a snoopy cache multiprocessor system, each processor has a cache in which it stores blocks of ... more In a snoopy cache multiprocessor system, each processor has a cache in which it stores blocks of data. Each cache is connected to a bus used to communicate with the other caches and with main memory. Each cache monitors the activity on the bus and in its own processor and decides which blocks of data to keep and which to discard. For several of the proposed architectures for snoopy caching systems, we present new on-line algorithms to be used by the caches to decide which blocks to retain and which to drop in order to minimize communication over the bus. We prove that, for any sequence of operations, our algorithms' communication costs are within a constant factor of the minimum required for that sequence; for some of our algorithms we prove that no on-line algorithm has this property with a smaller constant.