dblp.uni-trier.dewww.uni-trier.de

Steven Phillips

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2002
23EEPhillip B. Gibbons, John L. Bruno, Steven Phillips: Black-Box Correctness Tests for Basic Parallel Data Structures. Theory Comput. Syst. 35(4): 391-432 (2002)
2000
22EEDavid S. Johnson, Maria Minkoff, Steven Phillips: The prize collecting Steiner tree problem: theory and practice. SODA 2000: 760-769
21EESteven Phillips: Constituent similarity and systematicity: the limits of first-order connectionism. Connect. Sci. 12(1): 45-63 (2000)
1999
20EEPhillip B. Gibbons, John L. Bruno, Steven Phillips: Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures. SPAA 1999: 44-53
19 Steven Phillips, Anne Rogers: Parallel Speech Recognition. International Journal of Parallel Programming 27(4): 257-288 (1999)
18 Carsten Lund, Steven Phillips, Nick Reingold: Paging Against a Distribution and IP Networking. J. Comput. Syst. Sci. 58(1): 222-232 (1999)
1998
17 Steven Phillips: A Comparison of Learning Transfer in Networks and Humans. ICONIP 1998: 691-694
16EESteven Phillips: Are Feedforward and Recurrent Networks Systematic? Analysis and Implications for a Connectionist Cognitive Architecture. Connect. Sci. 10(2): 137-160 (1998)
1997
15 Kazuo Hiraki, Akio Sashima, Steven Phillips: Mental Tracking: A Computational Model of Spatial Development. IJCAI (1) 1997: 301-309
1996
14 John L. Bruno, Phillip B. Gibbons, Steven Phillips: Testing Concurrent Data Structures (Abstract). PODC 1996: 124
13 Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips: Biased Random Walks. Combinatorica 16(1): 1-18 (1996)
12 Sandy Irani, Anna R. Karlin, Steven Phillips: Strongly Competitive Algorithms for Paging with Locality of Reference. SIAM J. Comput. 25(3): 477-497 (1996)
11EEDon Coppersmith, Steven Phillips: On a Question of Erdös on Subsequence Sums. SIAM J. Discrete Math. 9(2): 173-177 (1996)
1995
10 Carsten Lund, Steven Phillips, Nick Reingold: Adaptive Hodling Policies for IP over ATM Networks. INFOCOM 1995: 80-87
9 Srinivasan Keshav, Carsten Lund, Steven Phillips, Nick Reingold, Huzur Saran: An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. IEEE Journal on Selected Areas in Communications 13(8): 1371-1382 (1995)
8EEAndrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold: Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. 55(6): 329-332 (1995)
1994
7 Carsten Lund, Steven Phillips, Nick Reingold: IP over connection-oriented networks and distributional paging FOCS 1994: 424-434
6 Rajeev Motwani, Steven Phillips, Eric Torng: Non-Clairvoyant Scheduling. Theor. Comput. Sci. 130(1): 17-47 (1994)
1993
5 Johan Håstad, Steven Phillips, Shmuel Safra: A Well-Characterized Approximation Problem. ISTCS 1993: 261-265
4EESteven Phillips, Jeffery Westbrook: Online load balancing and network flow. STOC 1993: 402-411
3 Johan Håstad, Steven Phillips, Shmuel Safra: A Well-Characterized Approximation Problem. Inf. Process. Lett. 47(6): 301-305 (1993)
1992
2EESandy Irani, Anna R. Karlin, Steven Phillips: Strongly Competitive Algorithms for Paging with Locality of Reference. SODA 1992: 228-236
1 Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips: Biased Random Walks STOC 1992: 1-9

Coauthor Index

1Yossi Azar [1] [13]
2Andrei Z. Broder [1] [8] [13]
3John L. Bruno [14] [20] [23]
4Don Coppersmith [11]
5Alan M. Frieze [8]
6Phillip B. Gibbons [14] [20] [23]
7Johan Håstad [3] [5]
8Kazuo Hiraki [15]
9Sandy Irani [2] [12]
10David S. Johnson [22]
11Anna R. Karlin [1] [2] [12] [13]
12Srinivasan Keshav [9]
13Nathan Linial (Nati Linial) [1] [13]
14Carsten Lund [7] [8] [9] [10] [18]
15Maria Minkoff [22]
16Rajeev Motwani [6]
17Nick Reingold [7] [8] [9] [10] [18]
18Anne Rogers [19]
19Shmuel Safra [3] [5]
20Huzur Saran [9]
21Akio Sashima [15]
22Eric Torng [6]
23Jeffery Westbrook [4]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)