default search action
Alan G. Konheim
Person information
- affiliation: University of California, Santa Barbara, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j34]Alan G. Konheim:
Horst Feistel: the inventor of LUCIFER, the cryptographic algorithm that changed cryptology. J. Cryptogr. Eng. 9(1): 85-100 (2019) - 2016
- [j33]Alan G. Konheim:
Automated teller machines: their history and authentication protocols. J. Cryptogr. Eng. 6(1): 1-29 (2016) - 2015
- [j32]Alan G. Konheim:
The Impetus to Creativity in Technology. Cryptologia 39(4): 291-314 (2015) - 2014
- [j31]Alan G. Konheim:
To Let Them Monitor or Not ... Perhaps that Is Not the Real Question [Commentary]. IEEE Technol. Soc. Mag. 33(3): 9-13 (2014)
1990 – 1999
- 1997
- [c9]Gísli Hjálmtýsson, Alan G. Konheim:
Analyzing a Two-Stage Entry Monitor for High-Speed Networks. INFOCOM 1997: 601-610 - 1996
- [j30]Gísli Hjálmtýsson, Alan G. Konheim:
The Sticky Buffer Flow Control for the ATM. Perform. Evaluation 26(4): 289-320 (1996) - [j29]Alan G. Konheim, Hanoch Levy, Mandyam M. Srinivasan:
Corrections to "Descendant Set: An Efficient Approach for the Analysis of Polling Systems". IEEE Trans. Commun. 44(7): 776 (1996) - [j28]Gísli Hjálmtýsson, Alan G. Konheim:
Policing and traffic shaping at the user-network-interface (UNI). Telecommun. Syst. 6(1): 261-288 (1996) - 1994
- [j27]H. Richard Gail, Sidney L. Hantler, Alan G. Konheim, B. A. Taylor:
An Analysis of a Class of Telecommunications Models. Perform. Evaluation 21(1-2): 151-161 (1994) - [j26]Alan G. Konheim, Hanoch Levy, Mandyam M. Srinivasan:
Descendant set: an efficient approach for the analysis of polling systems. IEEE Trans. Commun. 42(234): 1245-1253 (1994) - 1992
- [c8]Alan G. Konheim, Hanoch Levy:
Efficient Analysis of Polling Systems. INFOCOM 1992: 2325-2331
1980 – 1989
- 1987
- [j25]Micha Hofri, Alan G. Konheim:
Padded Lists Revisited. SIAM J. Comput. 16(6): 1073-1114 (1987) - 1984
- [j24]Onno J. Boxma, Frank P. Kelly, Alan G. Konheim:
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues. J. ACM 31(1): 128-133 (1984) - [j23]M. Keane, Alan G. Konheim, Isaac Meilijson:
The Organ Pipe Permutation. SIAM J. Comput. 13(3): 531-540 (1984) - [j22]Alan G. Konheim, Raymond L. Pickholtz:
Analysis of Integrated Voice/Data Multiplexing. IEEE Trans. Commun. 32(2): 140-147 (1984) - [c7]Alan G. Konheim:
Cryptanalysis of ADFGVX Encipherment Systems (Extended Abstract). CRYPTO 1984: 339-341 - 1982
- [c6]Alan G. Konheim:
Cryptanalysis of a Kryha Machine. EUROCRYPT 1982: 49-64 - 1981
- [j21]Onno J. Boxma, Alan G. Konheim:
Approximate Analysis of Exponential Queueing Systems with Blocking. Acta Informatica 15: 19-66 (1981) - [j20]Alan G. Konheim:
Guest Editor's Prologue. IEEE Trans. Commun. 29(6): 761 (1981) - [c5]Alan G. Konheim:
One-way Sequence for Transaction Verification. CRYPTO 1981: 38 - [c4]Alon Itai, Alan G. Konheim, Michael Rodeh:
A Sparse Table Implementation of Priority Queues. ICALP 1981: 417-431 - 1980
- [j19]Alan G. Konheim, Marian H. Mack, Robert K. McNeill, Bryant Tuckerman, Gerald Waldbaum:
The IPS Cryptographic Programs. IBM Syst. J. 19(2): 253-283 (1980) - [j18]Alan G. Konheim:
A Queueing Analysis of Two ARQ Protocols. IEEE Trans. Commun. 28(7): 1004-1014 (1980)
1970 – 1979
- 1978
- [j17]Alan G. Konheim, Martin Reiser:
Finite Capacity Queuing Systems with Applications in Computer Modeling. SIAM J. Comput. 7(2): 210-229 (1978) - 1977
- [j16]Ian F. Blake, Alan G. Konheim:
Big Buckets Are (Are Not) Better! J. ACM 24(4): 591-606 (1977) - [j15]Hisashi Kobayashi, Alan G. Konheim:
Queueing Models for Computer Communications System Analysis. IEEE Trans. Commun. 25(1): 2-29 (1977) - [j14]Bezalel Gavish, Alan G. Konheim:
Computer Communication Via Satellites-A Queueing Model. IEEE Trans. Commun. 25(1): 140-147 (1977) - 1976
- [j13]Alan G. Konheim, Martin Reiser:
A Queueing Model with Finite Waiting Room and Blocking. J. ACM 23(2): 328-341 (1976) - [j12]Alan G. Konheim:
Chaining in a Loop System. IEEE Trans. Commun. 24(2): 203-210 (1976) - [c3]Martin Reiser, Alan G. Konheim:
Queueing Model of a Multiprogrammed Computer System with a Jobqueue and a Fixed Number of Initiators. Performance 1976: 319-334 - 1975
- [j11]Alan G. Konheim:
An Elementary Solution of the Queuing System G/G/1. SIAM J. Comput. 4(4): 540-545 (1975) - 1974
- [j10]Steven Katz, Alan G. Konheim:
Priority Disciplines in a Loop System. J. ACM 21(2): 340-349 (1974) - [j9]Alan G. Konheim, Bernd Meister:
Waiting Lines and Times in a System with Polling. J. ACM 21(3): 470-490 (1974) - [c2]Martin Reiser, Alan G. Konheim:
The analysis of storage constraints by a queueing network model with blocking. SIGMETRICS 1974: 76-81 - 1973
- [j8]Alan G. Konheim, Donald J. Newman:
A note on growing binary trees. Discret. Math. 4(1): 57-63 (1973) - [j7]Alan G. Konheim, Bernd Meister:
Distributions of Queue Lengths and Waiting Times in a Loop with Two-Way Traffic. J. Comput. Syst. Sci. 7(5): 506-521 (1973) - 1972
- [j6]Alan G. Konheim, Bernd Meister:
Service in a Loop System. J. ACM 19(1): 92-108 (1972) - [j5]Alan G. Konheim:
A Note on Merging. SIAM J. Comput. 1(2): 161-166 (1972) - [j4]Wesley W. Chu, Alan G. Konheim:
On the Analysis and Modeling of a Class of Computer Communication Systems. IEEE Trans. Commun. 20(3): 645-660 (1972) - 1971
- [j3]William H. Burge, Alan G. Konheim:
An Accessing Model. J. ACM 18(2): 400-404 (1971) - [j2]Alan G. Konheim, Bernd Meister:
Two-way traffic in loop service systems. Networks 1(4): 291-301 (1971) - [c1]Alan G. Konheim, Bernd Meister:
Polling in a multidrop communication system: Waiting line analysis. Symposium on Problems in the Optimizations of Data Communications Systems 1971: 124-129
1960 – 1969
- 1964
- [j1]Herbert J. Greenberg, Alan G. Konheim:
Linear and Nonlinear Methods in Pattern Classification. IBM J. Res. Dev. 8(3): 299-307 (1964)
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-07-29 21:29 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: