2004 | ||
---|---|---|
16 | Ira Pohl: C#: Should CS Switch? Software Engineering Research and Practice 2004: 909-915 | |
1991 | ||
15 | Daniel R. Edelson, Ira Pohl: A Copying Collector for C++. C++ Conference 1991: 85-102 | |
1989 | ||
14 | Daniel R. Edelson, Ira Pohl: C++: Solving C's Shortcomings? Comput. Lang. 14(3): 137-152 (1989) | |
1988 | ||
13 | Ira Pohl, Daniel R. Edelson: A To Z: C Language Shortcomings. Comput. Lang. 13(2): 51-64 (1988) | |
1986 | ||
12 | Daniel Ratner, Ira Pohl: Joint and LPA*: Combination of Approximation and Search. AAAI 1986: 173-177 | |
1984 | ||
11 | George Politowski, Ira Pohl: D-Node Retargeting in Bidirectional Heuristic Search. AAAI 1984: 274-277 | |
10 | EE | Ira Pohl: Social implications of artificial intelligence. ACM Conference on Computer Science 1984: 273 |
9 | EE | Ira Pohl: A hierarchy for classifying AI implications. ACM Conference on Computer Science 1984: 274-278 |
1977 | ||
8 | Ira Pohl, Alan Shaw: Introducing Computer Science - An Alternative. IFIP Congress 1977: 53-56 | |
1975 | ||
7 | Ira Pohl: Minimean Optimality in Sorting Algorithms FOCS 1975: 71-74 | |
1973 | ||
6 | Ira Pohl: The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving. IJCAI 1973: 12-17 | |
1972 | ||
5 | Ira Pohl: A Sorting Problem and Its Complexity. Commun. ACM 15(6): 462-464 (1972) | |
1970 | ||
4 | Ira Pohl: Heuristic Search Viewed as Path Finding in a Graph. Artif. Intell. 1(3): 193-204 (1970) | |
1968 | ||
3 | EE | Ira Pohl, J. J. Duby: Letters to the editor: Improved Hamiltonian Paths. Commun. ACM 11(1): 1 (1968) |
1967 | ||
2 | EE | Ira Pohl: Phas-structure productions in PL/I: Phas-structure productions in PL/I0. Commun. ACM 10(12): 757 (1967) |
1 | EE | Ira Pohl: A method for finding Hamilton paths and Knight's tours. Commun. ACM 10(7): 446-449 (1967) |
1 | J. J. Duby | [3] |
2 | Daniel R. Edelson | [13] [14] [15] |
3 | George Politowski | [11] |
4 | Daniel Ratner | [12] |
5 | Alan Shaw | [8] |