Robert E Tarjan (Robert E. Tarjan)

used books, rare books and new books

• 
  An efficient parallel biconnectivity algorithm
  

  by Robert E Tarjan , U Vishkin

  ISBN 9781178485820 (978-1-178-48582-0)
  Softcover, Nabu Press, 2011

  
  Find This Book

   

   

  › Find signed collectible books: 'An efficient parallel biconnectivity algorithm'
  
• 
  A linear time algorithm for finding an ambitus
  

  by B Mishra, Robert E Tarjan

  ISBN 9781178971361 (978-1-178-97136-1)
  Softcover, Nabu Press, 2011

  
  Find This Book

   

   

  › Find signed collectible books: 'A linear time algorithm for finding an ambitus'
  
• 
  More efficient bottom-up multipattern matching in trees
  

  by Jiazhen Cai, Robert Paige, Robert E Tarjan

  ISBN 9781179416168 (978-1-179-41616-8)
  Softcover, Nabu Press, 2011

  
  Find This Book

   

   

  › Find signed collectible books: 'More efficient bottom-up multipattern matching in trees'
  
• 
  Notes on Introductory Combinatorics
  

  by Jiazhen Cai, Robert Paige, Robert E Tarjan

  ISBN 9780817631703 (978-0-8176-3170-3)
  Softcover, Birkhäuser, 1990

  
  Find This Book

   

   

  › Find signed collectible books: 'Notes on Introductory Combinatorics'
  
• 
  Notes on Introductory Combinatorics
  

  by Jiazhen Cai, Robert Paige, Robert E Tarjan

  ISBN 9780817631239 (978-0-8176-3123-9)
  Hardcover, Birkhauser, 1983

  
  Find This Book

   

   

  › Find signed collectible books: 'Notes on Introductory Combinatorics'
  
• 
  Notes on Introductory Combinatorics (Modern Birkhäuser Classics)
  

  by Jiazhen Cai, Robert Paige, Robert E Tarjan

  ISBN 9780817649524 (978-0-8176-4952-4)
  Softcover, Birkhäuser, 2009

  
  Find This Book

   

   

  › Find signed collectible books: 'Notes on Introductory Combinatorics (Modern Birkhäuser Classics)'
  
• 
  An O(n log n) algorithm for the maximal planar subgraph problem
  

  by Jiazhen Cai, Xiaofeng Han, Robert E Tarjan

  ISBN 9781179791784 (978-1-179-79178-4)
  Softcover, Nabu Press, 2011

  
  Find This Book

   

   

  › Find signed collectible books: 'An O(n log n) algorithm for the maximal planar subgraph problem'