 | 2008 |
| 12 |  | Eduardo Sany Laber,
Claudson F. Bornstein,
Loana Tito Nogueira,
Luerbio Faria:
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings
Springer 2008 |
| 2006 |
| 11 |  | Claudson F. Bornstein,
Eduardo Sany Laber,
Marcelo Mas:
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.
LATIN 2006: 211-223 |
| 10 |  | Claudson F. Bornstein,
Celina M. Herrera de Figueiredo,
Vinícius G. P. de Sá:
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem.
Inf. Process. Lett. 98(3): 87-91 (2006) |
| 2005 |
| 9 |  | Claudson F. Bornstein,
Eduardo Sany Laber,
Marcelo Albuquerque Fernandes Más:
Randomized mechanisms for limited supply multi-item auctions.
Electronic Notes in Discrete Mathematics 19: 141-147 (2005) |
| 2004 |
| 8 |  | Claudson F. Bornstein,
Santosh Vempala:
Flow metrics.
Theor. Comput. Sci. 321(1): 13-24 (2004) |
| 2002 |
| 7 |  | Claudson F. Bornstein,
Santosh Vempala:
Flow Metrics.
LATIN 2002: 516-527 |
| 1999 |
| 6 |  | Claudson F. Bornstein,
Bruce M. Maggs,
Gary L. Miller,
R. Ravi:
Redeeming Nested Dissection: Parallelism Implies Fill.
PPSC 1999 |
| 5 |  | Claudson F. Bornstein,
Bruce M. Maggs,
Gary L. Miller:
Tradeoffs Between Parallelism and Fill in Nested Dissection.
SPAA 1999: 191-200 |
| 1998 |
| 4 |  | Claudson F. Bornstein,
Ami Litman,
Bruce M. Maggs,
Ramesh K. Sitaraman,
Tal Yatzkar:
On the Bisection Width and Expansion of Butterfly Networks.
IPPS/SPDP 1998: 144-150 |
| 1997 |
| 3 |  | Claudson F. Bornstein,
Bruce M. Maggs,
Gary L. Miller,
R. Ravi:
Parallelizing Elimination Orders with Linear Fill.
FOCS 1997: 274-283 |
| 1994 |
| 2 |  | Claudson F. Bornstein,
Peter Steenkiste:
Data Reshuffling in Support of Fast I/O for Distributed-Memory Machines.
HPDC 1994: 227-235 |
| 1 |  | Jayme Luiz Szwarcfiter,
Claudson F. Bornstein:
Clique Graphs of Chordal and Path Graphs.
SIAM J. Discrete Math. 7(2): 331-336 (1994) |