Abstract
The 2005 Danny Lewin Prize for the best student paper at STOC was awarded to Vladimir Trifonov, of the University of Texas at Austin, for his paper "An O (log n log log n ) Space Algorithm for Undirected st-Connectivity" [1]. Hal Gabow recently started the tradition of interviewing the Danny Lewin Prize winner and publishing the interview in SIGACT News. (An interview with the 2003 winner Tom Hayes can be found in the September 2003 issue.) I had the pleasure of (electronically) chatting with Vladimir about his work; a transcript of our conversation follows.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
