×

Found 2,281 Documents (Results 1–100)

An algorithm for the fractal coding of images in a domain of wavelet transformations. (Russian) Zbl 1494.94030

Sergienko, I. V., Komp’yuterna matematyka. Optymizatsiya obchyslen’. Tom 1. Kiev: Natsional’naya Akademiya Nauk Ukrainy, Institut Kibernetiki im. V. M. Glushkova. 385-391 (2001).
MSC:  94A29 94A08
PDFBibTeX XMLCite

Irreducible trinomials over finite fields. (English) Zbl 1356.11087

Proceedings of the 2001 international symposium on symbolic and algebraic computation, ISSAC ’01, London, Ontario, Canada, 2001. New York, NY: ACM Press (ISBN 1-58113-417-7). 332-336 (2001).
MSC:  11T06 11Y16 68W30
PDFBibTeX XMLCite
Full Text: DOI

Why Kolmogorov complexity? (English) Zbl 1333.68151

Goles, Eric (ed.) et al., Complex systems. Papers from the 6th summer school, Santiago, Chile, December 14–18, 1998. Dordrecht: Kluwer Academic Publishers (ISBN 0-7923-6830-4/hbk). Nonlinear Phenom. Complex Syst. 6, 201-260 (2001).
MSC:  68Q30 94A15
PDFBibTeX XMLCite
Full Text: DOI

Selective private function evaluation with applications to private statistics. (English) Zbl 1333.94052

Proceedings of the 20th annual ACM symposium on principles of distributed computing, PODC ’01, Newport, RI, USA, August 26–28, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-383-9). 293-304 (2001).
PDFBibTeX XMLCite
Full Text: DOI

An optimally robust hybrid mix network. (English) Zbl 1333.94039

Proceedings of the 20th annual ACM symposium on principles of distributed computing, PODC ’01, Newport, RI, USA, August 26–28, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-383-9). 284-292 (2001).
MSC:  94A60 68M10
PDFBibTeX XMLCite
Full Text: DOI

Practical multi-candidate election system. (English) Zbl 1333.94030

Proceedings of the 20th annual ACM symposium on principles of distributed computing, PODC ’01, Newport, RI, USA, August 26–28, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-383-9). 274-283 (2001).
MSC:  94A60 68M14
PDFBibTeX XMLCite
Full Text: DOI Link

Secure safe ambients. (English) Zbl 1323.68404

Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’01, London, UK, January 17–19, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-336-7). 222-235 (2001).
PDFBibTeX XMLCite
Full Text: DOI

Oracle-based checking of untrusted software. (English) Zbl 1323.68222

Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’01, London, UK, January 17–19, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-336-7). 142-154 (2001).
PDFBibTeX XMLCite
Full Text: DOI

Mobile values, new names, and secure communication. (English) Zbl 1323.68398

Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’01, London, UK, January 17–19, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-336-7). 104-115 (2001).
MSC:  68Q85 68Q55 94A60
PDFBibTeX XMLCite
Full Text: DOI

Fast computation of low rank matrix approximations. (English) Zbl 1311.94032

Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001. Hersonissos, Crete, Greece, July 6–8, 2001. New York, NY: ACM Press (ISBN 1-581-13349-9). 611-618 (2001).
MSC:  94A20 15A18 68W40
PDFBibTeX XMLCite
Full Text: DOI

Communication preserving protocols for secure function evaluation. (English) Zbl 1323.68317

Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001. Hersonissos, Crete, Greece, July 6–8, 2001. New York, NY: ACM Press (ISBN 1-581-13349-9). 590-599 (2001).
PDFBibTeX XMLCite
Full Text: DOI

The round complexity of verifiable secret sharing and secure multicast. (English) Zbl 1317.68072

Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001. Hersonissos, Crete, Greece, July 6–8, 2001. New York, NY: ACM Press (ISBN 1-581-13349-9). 580-589 (2001).
MSC:  68Q25 94A60 94A62
PDFBibTeX XMLCite
Full Text: DOI

Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds. (English) Zbl 1317.68064

Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001. Hersonissos, Crete, Greece, July 6–8, 2001. New York, NY: ACM Press (ISBN 1-581-13349-9). 570-579 (2001).
MSC:  68Q25 94A60
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

Biographic Reference

all top 3

Software