The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Steven G. Finn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Steven G. Finn, Muriel Médard, Richard A. Barry
    A Novel Approach to Automatic Protection Switching Using Trees. [Citation Graph (0, 0)][DBLP]
    ICC (1), 1997, pp:272-276 [Conf]
  2. Muriel Médard, Steven G. Finn, Richard A. Barry
    WDM Loop-back Recovery in Mesh Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:752-759 [Conf]
  3. Richard A. Barry, Vincent W. S. Chan, Katherine L. Hall, Emily S. Kintzer, J. D. Moores, Kristin A. Rauschenbach, Eric A. Swanson, Laura E. Adams, Chris R. Doerr, Steven G. Finn, Hermann A. Haus, Erich P. Ippen, William S. Wong, Mark Haner
    All-Optical Network Consortium - Ultrafast TDM Networks (Invited Paper). [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1996, v:14, n:5, pp:999-1013 [Journal]
  4. Ivan P. Kaminow, Chris R. Doerr, Corrado Dragone, Tom Koch, Uzi Koren, Adel A. M. Saleh, Alan J. Kirby, Cüneyt M. Özveren, B. Schofield, Robert E. Thomas, Richard A. Barry, Daniel M. Castagnozzi, Vincent W. S. Chan, B. Roe Hemenway Jr., Douglas Marquis, Salil A. Parikh, Mark L. Stevens, Eric A. Swanson, Steven G. Finn, Robert G. Gallager
    A Wideband All-Optical WDM Network (Invited Paper). [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1996, v:14, n:5, pp:780-799 [Journal]
  5. Leslie D. Servi, Steven G. Finn
    M/M/1 queues with working vacations (M/M/1/WV). [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2002, v:50, n:1, pp:41-52 [Journal]
  6. Muriel Médard, Richard A. Barry, Steven G. Finn, Wenbo He, Steven Lumetta
    Generalized loop-back recovery in optical mesh networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:1, pp:153-164 [Journal]
  7. Muriel Médard, Steven G. Finn, Richard A. Barry
    Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1999, v:7, n:5, pp:641-652 [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002