| 2007 |
| 27 | EE | Arthur M. Farley:
Choice and development.
GECCO (Companion) 2007: 2468-2474 |
| 2005 |
| 26 | EE | Arthur M. Farley:
Population Structure and Artificial Evolution.
Artificial Evolution 2005: 213-225 |
| 25 | EE | Arthur M. Farley,
Andrzej Proskurowski:
Priority-Consistent Graphs.
Electronic Notes in Discrete Mathematics 22: 521-526 (2005) |
| 2004 |
| 24 | EE | Arthur M. Farley,
Andrzej Proskurowski,
Daniel Zappala,
Kurt J. Windisch:
Spanners and message distribution in networks.
Discrete Applied Mathematics 137(2): 159-171 (2004) |
| 23 | EE | Arthur M. Farley:
Minimal path broadcast networks.
Networks 43(2): 61-70 (2004) |
| 2003 |
| 22 | EE | Satoshi Fujita,
Arthur M. Farley:
Sparse Hypercube - Minimal k-line Broadcast Graph.
Discrete Applied Mathematics 127(3): 431-446 (2003) |
| 2000 |
| 21 | | Arthur M. Farley,
Paraskevi Fragopoulou,
David W. Krumme,
Andrzej Proskurowski,
Dana Richards:
Multi-Source Spanning Tree Problems.
Journal of Interconnection Networks 1(1): 61-71 (2000) |
| 1999 |
| 20 | EE | Satoshi Fujita,
Arthur M. Farley:
Sparse Hypercube: A Minimal k-Line Broadcast Graph.
IPPS/SPDP 1999: 320-324 |
| 19 | | Arthur M. Farley,
Paraskevi Fragopoulou,
David W. Krumme,
Andrzej Proskurowski,
Dana Richards:
Multi-Source Spanning Tree Problems.
SIROCCO 1999: 126-136 |
| 18 | | Juan J. Flores,
Arthur M. Farley:
Reasoning about Linear Circuits: A Model-Based Approach.
AI Commun. 12(1-2): 61-77 (1999) |
| 1998 |
| 17 | EE | Arthur M. Farley,
Andrzej Pelc,
Andrzej Proskurowski:
Minimum-time multidrop broadcast.
Discrete Applied Mathematics 83(1-3): 61-77 (1998) |
| 16 | | Arthur M. Farley:
Optimally Routable Networks.
Parallel Processing Letters 8(4): 567-575 (1998) |
| 1997 |
| 15 | EE | Satoshi Fujita,
Arthur M. Farley:
Minimum-cost Line Broadcast in Paths.
Discrete Applied Mathematics 75(3): 255-268 (1997) |
| 1996 |
| 14 | | Kathleen Freeman,
Arthur M. Farley:
A Model of Argumentation and Its Application to Legal Reasoning.
Artif. Intell. Law 4(3-4): 163-197 (1996) |
| 1995 |
| 13 | EE | Arthur M. Farley,
Kathleen Freeman:
Burden of Proof in Legal Argumentation.
ICAIL 1995: 156-164 |
| 1994 |
| 12 | | Arthur M. Farley,
Andrzej Proskurowski:
Bounded-call broadcasting.
Discrete Applied Mathematics 53(1-3): 37-53 (1994) |
| 1993 |
| 11 | | Arthur M. Farley,
Andrzej Proskurowski:
Self-Repairing Networks.
Parallel Processing Letters 3: 381-391 (1993) |
| 1991 |
| 10 | | Zheng-Yang Liu,
Arthur M. Farley:
Structural Aggregation in Common-Sense Reasoning.
AAAI 1991: 868-873 |
| 1990 |
| 9 | | Zheng-Yang Liu,
Arthur M. Farley:
Shifting Ontological Perspectives in Reasoning About Physical Systems.
AAAI 1990: 395-400 |
| 1989 |
| 8 | | Grant A. Cheston,
Arthur M. Farley,
Stephen T. Hedetniemi,
Andrzej Proskurowski:
Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett. 32(5): 247-250 (1989) |
| 1988 |
| 7 | | John S. Anderson,
Arthur M. Farley:
Plan Abstraction Based on Operator Generalization.
AAAI 1988: 100-104 |
| 1986 |
| 6 | | William S. Bergar,
Arthur M. Farley,
Garland Bayley:
Knowledge sources for an intelligent algebra tutor.
Computational Intelligence 2: 117-129 (1986) |
| 1982 |
| 5 | | Arthur M. Farley,
Andrzej Proskurowski:
Directed Maximal-Cut Problems.
Inf. Process. Lett. 15(5): 238-241 (1982) |
| 1980 |
| 4 | | Arthur M. Farley:
On Waiting.
AAAI 1980: 128-130 |
| 3 | | Arthur M. Farley:
Levelling Terrain Trees: A Transshipment Problem.
Inf. Process. Lett. 10(4/5): 189-192 (1980) |
| 1977 |
| 2 | | Arthur M. Farley:
The Coordination of Multiple Goal Satisfaction.
IJCAI 1977: 495 |
| 1975 |
| 1 | | Arthur M. Farley:
Constructive Visual Imagery And Perception.
IJCAI 1975: 885-892 |