default search action
Ira Pohl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c10]Michael W. Barley, Patricia J. Riddle, Carlos Linares López, Sean Dobson, Ira Pohl:
GBFHS: A Generalized Breadth-First Heuristic Search Algorithm. SOCS 2018: 28-36
2000 – 2009
- 2004
- [c9]Ira Pohl:
C#: Should CS Switch? Software Engineering Research and Practice 2004: 909-915
1990 – 1999
- 1995
- [b5]Al Kelley, Ira Pohl:
A book on C - programming in C (3. ed.). Benjamin/Cummings 1995, ISBN 978-0-8053-1677-3, pp. I-XIX, 1-636 - 1991
- [b4]Ira Pohl:
Turbo C++. Benjamin/Cummings 1991, ISBN 978-0-8053-6017-2, pp. I-XV, 1-279 - [c8]Daniel R. Edelson, Ira Pohl:
A Copying Collector for C++. C++ Conference 1991: 85-102 - 1990
- [b3]Al Kelley, Ira Pohl:
A book on C - programming in C (2. ed.). Addison-Wesley 1990, ISBN 978-0-8053-0060-4, pp. I-XV, 1-525
1980 – 1989
- 1989
- [b2]Ira Pohl:
C++ for C programmers. Benjamin/Cummings 1989, ISBN 978-0-8053-0910-2, pp. I-XII, 1-244 - [j9]Daniel R. Edelson, Ira Pohl:
C++: Solving C's Shortcomings? Comput. Lang. 14(3): 137-152 (1989) - 1988
- [j8]Ira Pohl, Daniel R. Edelson:
A To Z: C Language Shortcomings. Comput. Lang. 13(2): 51-64 (1988) - 1987
- [j7]Ira Pohl:
Should robots have nuclear arms? AI technology and SDI software. Future Gener. Comput. Syst. 3(2): 111-115 (1987) - 1986
- [j6]Ira Pohl:
SDI software: AI is not the answer. ACM SIGSOFT Softw. Eng. Notes 11(2): 18-19 (1986) - [c7]Daniel Ratner, Ira Pohl:
Joint and LPA*: Combination of Approximation and Search. AAAI 1986: 173-177 - 1984
- [c6]George Politowski, Ira Pohl:
D-Node Retargeting in Bidirectional Heuristic Search. AAAI 1984: 274-277 - [c5]Ira Pohl:
Social implications of artificial intelligence. ACM Annual Conference 1984: 273 - [c4]Ira Pohl:
A hierarchy for classifying AI implications. ACM Annual Conference 1984: 274-278
1970 – 1979
- 1977
- [c3]Ira Pohl, Alan Shaw:
Introducing Computer Science - An Alternative. IFIP Congress 1977: 53-56 - 1975
- [c2]Ira Pohl:
Minimean Optimality in Sorting Algorithms. FOCS 1975: 71-74 - 1973
- [c1]Ira Pohl:
The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving. IJCAI 1973: 12-17 - 1972
- [j5]Ira Pohl:
A Sorting Problem and Its Complexity. Commun. ACM 15(6): 462-464 (1972) - 1970
- [j4]Ira Pohl:
Heuristic Search Viewed as Path Finding in a Graph. Artif. Intell. 1(3): 193-204 (1970)
1960 – 1969
- 1969
- [b1]Ira Pohl:
Bi-directional and heuristic search in path problems. Stanford University, USA, 1969 - 1968
- [j3]Ira Pohl, J. J. Duby:
Letters to the editor: Improved Hamiltonian Paths. Commun. ACM 11(1): 1 (1968) - 1967
- [j2]Ira Pohl:
A method for finding Hamilton paths and Knight's tours. Commun. ACM 10(7): 446-449 (1967) - [j1]Ira Pohl:
Phas-structure productions in PL/I: Phas-structure productions in PL/I0. Commun. ACM 10(12): 757 (1967)
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:57 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: