Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robert J. Lambert

dblp:60/5607 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.012001
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms · CRYPTO 2001
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
scalar multiplication
0.012001
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms · CRYPTO 2001
Computational science and engineering › numerical analysis › numerical integration
ordinary differential equation solver
0.011962
Stability of a Generalized Corrector Formula · J. ACM 1962
YearPublicationVenuePosition
2001 Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone
CRYPTO2
1966 Pseudo-Runge-Kutta Methods Involving Two Points
abstract
A third order two step method and a fourth order two step method for the numerical solution of the vector initial value problem dy ÷ dx =F(y), y( a ) = n can be defined by making evaluations of F similar to those found in a classical Runge-Kutta formula. These two step methods are different from classical Runge-Kutta methods in that evaluations of F made at the previous point are used along with those made at the current point in order to obtain the solution at the next point. If the stepsize is fixed, this use of previous computations makes it possible to obtain the solution at the next point by evaluating F two or three times for the third or fourth order method, respectively. These methods are consistent with the initial value problem and are shown to be convergent with its unique solution under certain restrictions. The local truncation error terms are given. Finally, a few numerical results are presented.
George D. Byrne, Robert J. Lambert
J. ACM2
1962 Stability of a Generalized Corrector Formula
abstract
article Share on Stability of a Generalized Corrector Formula Authors: Roger L. Crane Iowa State University, Ames, Iowa Iowa State University, Ames, IowaView Profile , Robert J. Lambert Iowa State University, Ames, Iowa Iowa State University, Ames, IowaView Profile Authors Info & Claims Journal of the ACMVolume 9Issue 1Jan. 1962 pp 104–117https://doi.org/10.1145/321105.321116Published:01 January 1962Publication History 9citation304DownloadsMetricsTotal Citations9Total Downloads304Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Roger L. Crane, Robert J. Lambert
J. ACM2