|
Technical Reports by Amit Chakrabarti
| TR2010-667 |
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem |
| Author: Amit Chakrabarti |
| TR2009-646 |
An Information Complexity Approach to the Inner Product Problem |
| Authors: Amit Chakrabarti, William B. Henderson-Frost, Ranganath Kondapally |
| TR2009-642 |
Approximability of the Unsplittable Flow Problem on Trees |
| Authors: Chrisil Arackaparambil, Amit Chakrabarti, Chien-Chung Huang |
| TR2008-639 |
Functional Monitoring Without Monotonicity |
| Authors: Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti |
| TR2005-561 |
A Quasi-PTAS for Unsplittable Flow on Line Graphs |
| Authors: Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber |
| TR2005-560 |
Combinatorial Theorems about Embedding Trees on the Real Line |
| Authors: Amit Chakrabarti, Subhash Khot |
To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
|
|
;resetNavClock();){kind=small}
;resetNavClock();){kind=small}
;resetNavClock();){kind=small}
;resetNavClock();){kind=small}
;resetNavClock();){kind=small}
Subscribe to the Dartmouth CS Technical Report Feed