scispace - formally typeset
Search or ask a question
Institution

SRI International

NonprofitMenlo Park, California, United States
About: SRI International is a nonprofit organization based out in Menlo Park, California, United States. It is known for research contribution in the topics: Ionosphere & Laser. The organization has 7222 authors who have published 13102 publications receiving 660724 citations. The organization is also known as: Stanford Research Institute & SRI.


Papers
More filters
Journal ArticleDOI
R. Singleton1
TL;DR: Examples and construction methods are given to show that these codes exist for a number of values of q, k, and r and with the restriction that the codes be linear.
Abstract: A q -nary error-correcting code with N = q^{k} code words of length n = k + r can have no greater minimum distance d than r+1 . The class of codes for which d = r+1 is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values of q, k , and r .

525 citations

Posted Content
TL;DR: A multi-bit amortized version of Regev's lattice-based cryptosystem (STOC 2005) whose time and space complexity are improved by a linear factor in the security parameter n.
Abstract: We propose a simple and general framework for constructing oblivious transfer (OT) protocols that are ecient , universally composable, and generally realizable from a variety of standard number-theoretic assumptions, including the decisional Die-Hellman assumption, the quadratic residuosity assumption, and worst-case lattice assumptions. Our OT protocols are round-optimal (one message each way), quite ecient in computation and communication, and can use a single common string for an unbounded number of executions. Furthermore, the protocols can provide statistical security to either the sender or receiver, simply by changing the distribution of the common string. For certain instantiations of the protocol, even a common random string suces. Our key technical contribution is a simple abstraction that we call a dual-mode cryptosystem. We implement dual-mode cryptosystems by taking a unied view of several cryptosystems that have what we call \messy" public keys, whose dening

523 citations

Journal ArticleDOI
Robert Kozma1
TL;DR: In this paper, the role of multiple representations in understanding science is examined and the differences between expert chemists and chemistry students in their representational skills and in their use of representations in science laboratories are examined.

522 citations

Book ChapterDOI
Sam Owre1, S. Rajan1, John Rushby1, Natarajan Shankar1, Mandayam K. Srivas1 
03 Aug 1996
TL;DR: PVS (Prototype Verification System) is an environment for constructing clear and precise specifications and for developing readable proofs that have been mechanically verified to exploit the synergies between language and deduction, automation and interaction, and theorem proving and model checking.
Abstract: PVS (Prototype Verification System) is an environment for constructing clear and precise specifications and for developing readable proofs that have been mechanically verified. It is designed to exploit the synergies between language and deduction, automation and interaction, and theorem proving and model checking. For example, the type system of PVS requires the use of theorem proving to establish type correctness, and conversely, type information is used extensively during a proof. Similarly, decision procedures are heavily used in order to simplify the tedious and obvious steps in a proof leaving the user to interactively supply the high-level steps in a verification. Model checking is one such decision procedure that is used to discharge temporal properties of specific finite-state systems. A variety of examples from functional programming, fault tolerance, and real time computing have been verified using PVS [7]. The most substantial use of PVS has been in the verification of the microcode for selected instructions of a commercial-scale microprocessor called AAMP5 designed by Rockwell-Collins and containing about 500,000 transistors [5]. Most recently, PVS has been applied to the verification of the design of an SRT divider [9]. The key elements of the PVS design are described below in greater detail below.

521 citations


Authors

Showing all 7245 results

NameH-indexPapersCitations
Rodney S. Ruoff164666194902
Alex Pentland13180998390
Robert L. Byer130103696272
Howard I. Maibach116182160765
Alexander G. G. M. Tielens11572251058
Adolf Pfefferbaum10953040358
Amato J. Giaccia10841949876
Bernard Wood10863038272
Paul Workman10254738095
Thomas Kailath10266158069
Pascal Fua10261449751
Edith V. Sullivan10145534502
Margaret A. Chesney10132633509
Thomas C. Merigan9851433941
Carlos A. Zarate9741732921
Network Information
Related Institutions (5)
Massachusetts Institute of Technology
268K papers, 18.2M citations

92% related

University of Illinois at Urbana–Champaign
225.1K papers, 10.1M citations

91% related

Stanford University
320.3K papers, 21.8M citations

90% related

Columbia University
224K papers, 12.8M citations

90% related

University of California, San Diego
204.5K papers, 12.3M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20236
202237
2021178
2020223
2019256
2018218