Back to Results
First PageMeta Content
Network theory / Shortest path problem / Min-plus matrix multiplication / Algorithm / Routing algorithms / Widest path problem / Floyd–Warshall algorithm / Graph theory / Mathematics / Theoretical computer science


Document Date: 2008-08-20 17:25:20

Open Document

File Size: 676,13 KB

Share Result on Facebook

Country

United States / /

Facility

Computer Science Carnegie Mellon University / Tel Aviv University / /

IndustryTerm

polynomial algorithms / linear time algorithm / subcubic algorithm / rectangular matrix product / present algorithms / dominance product / /

Organization

Organization of the Thesis / National Science Foundation / U.S. government / Thesis Committee / Tel Aviv University / CMU-CS-08-147 School of Computer Science Carnegie Mellon University Pittsburgh / Carnegie Mellon / /

Person

Kelly Crawford / Ryan Williams / Manuel Blum Anupam Gupta Uri Zwick / Katrina Ligett / Guy Blelloch / Anupam Gupta / Mike Crawford / Avrim Blum / Michelle Goodstein / Tanya / Noam Zeilberger / Daniel Golovin / Panayot / Shobha Venkataraman / Alexander / Yordan / James Hays / Joey Gonzalez / Gary Miller / Vijay Vasudevan / Sonia Chernova / Uri Zwick / Manuel Blum / Gergana / Lenore Blum / Liz Crawford / Sue Ann Hong / Teena Williams / Gene Hambrick / Virginia Vassilevska / David Abraham / Nora Tu / Dan Wendlandt / Jialan Wang / Genka / Sam Ganzfried / Raphael Yuster / Anne Yust / Alice Brumley / /

Position

author / advisor / Chair / /

ProvinceOrState

Pennsylvania / /

Technology

also present algorithms / linear time algorithm / polynomial algorithms / Matrix Multiplication Algorithms / 3.6 Parallel Algorithms / /

SocialTag