Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Frank O. Hadlock

F. O. Hadlock

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

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

1977
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/Hadlock77
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Hadlock77
F. O. Hadlock:
A shortest path algorithm for grid graphs. Networks 7(4): 323-334 (1977)
1969
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/HadlockC69
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/HadlockC69
Frank O. Hadlock, Clarence L. Coates:
Realization of Sequential Machines with Threshold Elements. IEEE Trans. Computers 18(5): 428-439 (1969)
1967
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/Hadlock67
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/Hadlock67
Frank O. Hadlock:
On Finding a Minimal Set of Diagnostic Tests. IEEE Trans. Electron. Comput. 16(5): 674-675 (1967)

Conference and Workshop Papers

see FAQ

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

1966
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/HadlockC66
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/HadlockC66
F. O. Hadlock, C. L. Coates:
Realization of Sequential Machines with Threshold Elements. SWAT 1966: 172-183

Coauthor Index

see FAQ

a service of

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.