Ira Pohl

According to our database1, Ira Pohl authored at least 22 papers between 1967 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Awards

ACM Fellow

ACM Fellow 2001, "For outstanding contributions to computer science research and education in the areas of heuristic search, analysis of algorithms, and programming language methodology.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
GBFHS: A Generalized Breadth-First Heuristic Search Algorithm.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

2004
C#: Should CS Switch?
Proceedings of the International Conference on Software Engineering Research and Practice, 2004

1995
A book on C - programming in C (3. ed.).
Benjamin/Cummings, ISBN: 978-0-8053-1677-3, 1995

1991
A Copying Collector for C++.
Proceedings of the C++ Conference. Washington, D.C., USA, April 1991, 1991

Turbo C++.
Benjamin/Cummings, ISBN: 978-0-8053-6017-2, 1991

1990
A book on C - programming in C (2. ed.).
Addison-Wesley, ISBN: 978-0-8053-0060-4, 1990

1989
C++: Solving C's Shortcomings?
Comput. Lang., 1989

C++ for C programmers.
Benjamin/Cummings, ISBN: 978-0-8053-0910-2, 1989

1988
A To Z: C Language Shortcomings.
Comput. Lang., 1988

1987
Should robots have nuclear arms? AI technology and SDI software.
Future Generation Comp. Syst., 1987

1986
Joint and LPA*: Combination of Approximation and Search.
Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1984
A hierarchy for classifying AI implications.
Proceedings of the 1984 ACM Annual Conference on Computer Science: The fifth generation challenge, 1984

Social implications of artificial intelligence.
Proceedings of the 1984 ACM Annual Conference on Computer Science: The fifth generation challenge, 1984

D-Node Retargeting in Bidirectional Heuristic Search.
Proceedings of the National Conference on Artificial Intelligence. Austin, 1984

1977
Introducing Computer Science - An Alternative.
IFIP Congress, 1977

1975
Minimean Optimality in Sorting Algorithms
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1973
The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving.
Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, 1973

1972
A Sorting Problem and Its Complexity.
Commun. ACM, 1972

1970
Heuristic Search Viewed as Path Finding in a Graph.
Artif. Intell., 1970

1968
Letters to the editor: Improved Hamiltonian Paths.
Commun. ACM, 1968

1967
Phas-structure productions in PL/I: Phas-structure productions in PL/I0.
Commun. ACM, 1967

A method for finding Hamilton paths and Knight's tours.
Commun. ACM, 1967


  Loading...