default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames A. Reeds
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j18]Peter C. Fishburn, Aleksandar Pekec, James A. Reeds:
Subset Comparisons for Additive Linear Orders. Math. Oper. Res. 27(1): 227-243 (2002)- 2001
- [j17]Peter C. Fishburn, James A. Reeds:
Counting Split Semiorders. Order 18(2): 119-128 (2001) - [j16]James A. Reeds, Peter C. Fishburn:
Counting Split Interval Orders. Order 18(2): 129-135 (2001)
1990 – 1999
- 1998
- [j15]Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, Paul E. Wright:
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. SIAM J. Optim. 9(1): 112-147 (1998) - 1997
- [j14]J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds:
The d-Step Conjecture and Gaussian Elimination. Discret. Comput. Geom. 18(1): 53-82 (1997) - 1996
- [c3]J. C. Lagarias, Nagabhushana Prabhu, James A. Reeds:
The Parameter Space of the d-step Conjecture. FSTTCS 1996: 52-63 - 1994
- [j13]Peter C. Fishburn, James A. Reeds:
Bell Inequalities, Grothendieck's Constant, and Root Two. SIAM J. Discret. Math. 7(1): 48-56 (1994) - 1992
- [j12]Peter C. Fishburn, James A. Reeds:
Unit Distances Between Vertices of a Convex Polygon. Comput. Geom. 2: 81-91 (1992) - [j11]M. Douglas McIlroy, James A. Reeds:
Multilevel Security in the UNIX Tradition. Softw. Pract. Exp. 22(8): 673-694 (1992) - 1991
- [j10]Peter C. Fishburn, J. C. Lagarias, James A. Reeds, Larry A. Shepp:
Sets uniquely determined by projections on axes II Discrete case. Discret. Math. 91(2): 149-159 (1991)
1980 – 1989
- 1988
- [j9]J. C. Lagarias, James A. Reeds:
Unique Extrapolation of Polynomial Recurrences. SIAM J. Comput. 17(2): 342-362 (1988) - [j8]Lester E. Dubins, Alon Orlitsky, James A. Reeds, Lawrence A. Shepp:
Self-avoiding random loops. IEEE Trans. Inf. Theory 34(6): 1509-1516 (1988) - 1985
- [j7]James A. Reeds, Neil J. A. Sloane:
Shift-Register Synthesis (Modulo m). SIAM J. Comput. 14(3): 505-513 (1985) - 1984
- [j6]James A. Reeds, Peter J. Weinberger:
The UNIX system: File security and the UNIX system crypt command. AT&T Bell Lab. Tech. J. 63(8): 1673-1683 (1984) - [c2]James A. Reeds, John L. Manferdelli:
DES Has No Per Round Linear Factors. CRYPTO 1984: 377-389 - 1983
- [c1]James A. Reeds, Neil J. A. Sloane:
Shift-Register Synthesis (Modula m). CRYPTO 1983: 249 - 1982
- [j5]Dov Andelman, James A. Reeds:
On the cryptanalysis of rotor machines and substitution - permutation networks. IEEE Trans. Inf. Theory 28(4): 578-584 (1982)
1970 – 1979
- 1977
- [j4]James A. Reeds:
"Cracking" a Random Number Generator. Cryptologia 1(1): 20-26 (1977) - [j3]James A. Reeds:
Rotor Algebra. Cryptologia 1(2): 186-194 (1977) - [j2]James A. Reeds:
Entropy calculations and Particular Methods of Cryptanalysis. Cryptologia 1(3): 235-254 (1977) - [j1]Cipher A. Deavours, James A. Reeds:
The Enigma Part I Historical Perspectives. Cryptologia 1(4): 381-391 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
