Search the dblp DataBase
Alexander Birman :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Alexander Birman , Jeffrey D. Ullman Parsing Algorithms with Backtrack [Citation Graph (0, 0)][DBLP ] FOCS, 1970, pp:153-174 [Conf ] Erol Basturk , Alexander Birman , G. Delp , Roch Guérin , R. Haas , Sanjay Kamat , Dilip D. Kandlur , P. Pan , Dimitrios E. Pendarakis , Vinod G. J. Peris , Raju Rajan , Debanjan Saha , D. Williams Design and implementation of a QoS capable switch-router. [Citation Graph (0, 0)][DBLP ] ICCCN, 1997, pp:276-284 [Conf ] George B. Leeman Jr. , William C. Carter , Alexander Birman Some Techniques for Microprogram Validation. [Citation Graph (0, 0)][DBLP ] IFIP Congress, 1974, pp:76-80 [Conf ] Alexander Birman A High-Performance Switch with Applications to Frame Relay Networks. [Citation Graph (0, 0)][DBLP ] INFOCOM, 1990, pp:782-789 [Conf ] Alexander Birman Computing Approximate Blocking Probabilities for a Class of All-Optical Networks. [Citation Graph (0, 0)][DBLP ] INFOCOM, 1995, pp:651-658 [Conf ] Alexander Birman , Aaron Kershenbaum Routing and Wavelength Assignment Methods in Single-Hop All-Optical Networks with Blocking. [Citation Graph (0, 0)][DBLP ] INFOCOM, 1995, pp:431-438 [Conf ] Yaakov Kogan , Alexander Birman Asymptotic analysis of closed queueing networks with bottlenecks. [Citation Graph (0, 0)][DBLP ] Performance of Distributed Systems and Integrated Communication Networks, 1991, pp:265-280 [Conf ] Erol Basturk , Alexander Birman , G. Delp , Roch Guérin , R. Haas , Sanjay Kamat , Dilip D. Kandlur , P. Pan , Dimitrios E. Pendarakis , Vinod G. J. Peris , Raju Rajan , Debanjan Saha , D. Williams Design and Implementation of a QoS Capable Switch-Router. [Citation Graph (0, 0)][DBLP ] Computer Networks, 1999, v:31, n:1-2, pp:19-32 [Journal ] Alexander Birman , Jeffrey D. Ullman Parsing Algorithms with Backtrack [Citation Graph (0, 0)][DBLP ] Information and Control, 1973, v:23, n:1, pp:1-34 [Journal ] Alexander Birman On Proving Correctness of Microprograms. [Citation Graph (0, 0)][DBLP ] IBM Journal of Research and Development, 1974, v:18, n:3, pp:250-266 [Journal ] Se June Hong , John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2002, v:41, n:3, pp:328-330 [Journal ] John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2001, v:40, n:4, pp:812-813 [Journal ] John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2003, v:42, n:2, pp:203-204 [Journal ] John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2004, v:43, n:1, pp:3-4 [Journal ] John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2004, v:43, n:4, pp:622-623 [Journal ] John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2005, v:44, n:2, pp:213-214 [Journal ] John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2005, v:44, n:4, pp:651-652 [Journal ] John J. Ritsko , Alexander Birman Preface. [Citation Graph (0, 0)][DBLP ] IBM Systems Journal, 2006, v:45, n:2, pp:205-206 [Journal ] Alexander Birman , H. Richard Gail , Sidney L. Hantler , Zvi Rosberg , Moshe Sidi An Optimal Service Policy for Buffer Systems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1995, v:42, n:3, pp:641-657 [Journal ] Alexander Birman Computing Approximate Blocking Probabilities for a Class of All-Optical Networks. [Citation Graph (0, 0)][DBLP ] IEEE Journal on Selected Areas in Communications, 1996, v:14, n:5, pp:852-857 [Journal ] Alexander Birman , Yaakov Kogan Error Bounds for Asymptotic Approximations of the Partition Function. [Citation Graph (0, 0)][DBLP ] Queueing Syst., 1996, v:23, n:, pp:217-234 [Journal ] Alexander Birman , William H. Joyner Jr. A Problem-Reduction Approach to Proving Simulation Between Programs. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Software Eng., 1976, v:2, n:2, pp:87-96 [Journal ] Search in 0.006secs, Finished in 0.008secs