Selected Publications
- P. England and M. Peinado. Authenticated Operation of Open Computing Devices.
In Proceedings of the 7th Australasian Conference on Information Security
and Privacy (ACISP 2002). Pages 346-361, Springer-Verlag,
LNCS 2384,
August 2002. © Springer-Verlag
- M. Peinado. Go with the Winners Algorithms for Cliques in
Random Graphs. In Proceedings of the twelfth Annual International
Symposium on Algorithms and Computation (ISAAC 2001). Pages 525—536, Springer-Verlag, LNCS 2223,
December 2001.
- D. Kirovski , M. Peinado and F. Petitcolas. Digital
Rights Management for Digital Cinema. In Applications of Digital Image
Processing XXIV, Proceedings of SPIE, Volume 4472, August 2001.
- A. Juels and M. Peinado. Hiding Cliques for
Cryptographic Security. Designs, Codes and Cryptography,
20(3): 269--280, July 2000.
- Ö. Egecioglu and M. Peinado.
Algorithms
for almost-uniform generation with an unbiased binary source. In
Proceedings of the Fourth Annual Computing and Combinatorics
Conference (COCOON'98). Springer-Verlag. 1998.
- M. Peinado and T. Lengauer. Random Generation of Embedded Graphs and an
Extension to Dobrushin Uniqueness. In Proceedings of the 30th
Annual ACM Symposium on the Theory of Computing (STOC'98). Dallas,
Texas. 1998.
- V. Boyko, M. Peinado, and R.
Venkatesan. Speeding
up discrete log and factoring based schemes via pre-computation. In Proceedings
of Eurocrypt'98. Lecture Notes in Computer Science. Springer-Verlag. 1998.
- A. Juels and M. Peinado. Hiding Cliques for
Cryptographic Security. In Proceedings of the 9th Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA'98). San Francisco, California. 1998.
- M. Peinado and R. Venkatesan. Highly Parallel
Cryptographic Attacks. In Proc. 4th Euro PVM-MPI'97. Lecture
Notes in Computer Science. Springer-Verlag.
1997.
- S. Homer and M. Peinado. Two
Distributed Memory Parallel Approximation Algorithms for MaxCut.
Journal of Parallel and Distributed Computing. volume 1, pages 48—61,
1997.
- M. Peinado and T. Lengauer. 'Go with the
winners' Generators with Applications to Molecular Modeling. In Proceedings
of the First International Symposium on Approximation and Randomized
Techniques in Computer Science (RANDOM'97). Springer-Verlag. July 1997.
- M. Peinado and T. Lengauer. Parallel `go with the
winners algorithms' in the LogP Model. In Proceedings of the 11th
International Parallel Processing Symposium. pages 656 - 664. IEEE
Computer Society Press, Los Alamitos, California. April 1997.
- S. Homer and M. Peinado. On the
Performance of Polynomial-time CLIQUE Algorithms on Very Large Graphs
In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation
Challenge D. S. Johnson and M. Trick (Eds.). American Mathematical
Society. DIMACS Series in Discrete Mathematics and Theoretical Computer
Science. 1996.
- S. Homer and M. Peinado. A Highly
Parallel Algorithm to Approximate MaxCut on Distributed Memory
Architectures In Proceedings of the 9th International Parallel
Processing Symposium. IEEE
Computer Society Press, Los Alamitos, California. April 1995.
- M. Peinado. Parallel and Randomized
Approximation Algorithms for Maxclique and Maxcut and their Applications
Ph.D. thesis. Graduate School of Arts and Sciences. Boston University.
1995.
- S. Homer and M. Peinado. Using Positive
Semidefinite Programming to Search for Ground States in Ising Spin-Glass
Systems, In Proceedings of the 10th International Conference on
Mathematical and Computer Modeling and Scientific Computing
(ICMCM&SC). 1995.
- M. Peinado. Improved Lower Bounds for the Randomized
Boppana-Halldorsson Algorithm for MAXCLIQUE, In Proceedings of the
First Annual Computing and Combinatorics Conference (COCOON'95). Springer-Verlag. 1995.
- M. Peinado. Hard
graphs for the Randomized Boppana-Halldorsson Algorithm for Maxclique.
Nordic Journal of Computing. volume 1. pages 493 - 515. 1994.
- M. Peinado. Hard Graphs for Randomized Subgraph Exclusion
Algorithms. In Proceedings of the 4th Scandinavian Workshop on
Algorithm Theory (SWAT'94). Springer-Verlag LNCS824. 1994.
- M. Peinado. Effiziente Algorithmen fuer
das Ising-Modell Master's thesis. Technical University of
Berlin. 1991.
Marcus Peinado, January 6, 2002