default search action

combined dblp search
author search
venue search
publication search

ask others

Arthur B. Kahn

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

1960 – 1969

see FAQ

What is the meaning of the colors in the publication lists?

1968
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/sigcpr/Kahn68
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigcpr/Kahn68
Arthur B. Kahn:
Activated applicants: development of participation of applicants in selection and training. SIGCPR 1968: 27-42
1967
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/acm/Kahn67
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acm/Kahn67
Arthur B. Kahn:
An appreciation of computer appreciation. ACM National Conference 1967: 441-455
1963
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/cacm/Kahn63
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Kahn63
Arthur B. Kahn:
Skeletal structure of PERT and CPA computer programs. Commun. ACM 6(8): 473-479 (1963)
1962
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/cacm/Kahn62
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Kahn62
Arthur B. Kahn:
Topological sorting of large networks. Commun. ACM 5(11): 558-562 (1962)
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/acm/Kahn62
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acm/Kahn62
Arthur B. Kahn:
Applications in the physical sciences: Procedure Network Analysis. ACM National Conference 1962: 94-95

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.