technical reports : prof. dr. ir. J.A. La Poutré

select other reports
this selection
reports (7)
| techrep_id |
file |
title / author |
| RUU-CS-93-22 |
pdf |
Dynamic Microsets for RAMs J.A. La Poutré |
| RUU-CS-90-27 |
pdf |
Maintaining 2- and 3-connected components in graphs, Part II: 2- and 3-edge-connected components and 2-vertex-connected components J.A. La Poutré |
| RUU-CS-90-26 |
pdf |
Maintaining 2- and 3-connected components in graphs, Part I: 2- and 3-edge-connected components J.A. La Poutré and J. van Leeuwen and M.H. Overmars |
| RUU-CS-89-21 |
pdf |
Lowerbounds for the UNION-FIND and the SPLIT-FIND problem on pointer machines J.A. La Poutré |
| RUU-CS-89-20 |
not online |
A fast and optimal algorithm for the SPLIT-FIND problem on pointer machines (vervallen) J.A. La Poutré |
| RUU-CS-89-19 |
pdf |
New techniques for the UNION-FIND problem J.A. La Poutré |
| RUU-CS-87-25 |
pdf |
Maintenance of transitive closures and transitive reductions of graphs J.A. La Poutré and J. van Leeuwen |
BibTeX entries
@TECHREPORT{RUUCS9322,
author = {Poutré, J.A.~La},
year = 1993,
title = {Dynamic Microsets for RAMs},
number = {RUU-CS-93-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-22.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9027,
author = {Poutré, J.A.~La},
year = 1990,
title = {Maintaining 2- and 3-connected components in graphs, Part II: 2- and 3-edge-connected components and 2-vertex-connected components},
number = {RUU-CS-90-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-27.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9026,
author = {Poutré, J.A.~La and Leeuwen, J.~van and Overmars, M.H.},
year = 1990,
title = {Maintaining 2- and 3-connected components in graphs, Part I: 2- and 3-edge-connected components},
number = {RUU-CS-90-26},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-26.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8921,
author = {Poutré, J.A.~La},
year = 1989,
title = {Lowerbounds for the UNION-FIND and the SPLIT-FIND problem on pointer machines},
number = {RUU-CS-89-21},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-21.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8920,
author = {Poutré, J.A.~La},
year = 1989,
title = {A fast and optimal algorithm for the SPLIT-FIND problem on pointer machines (vervallen)},
number = {RUU-CS-89-20},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8919,
author = {Poutré, J.A.~La},
year = 1989,
title = {New techniques for the UNION-FIND problem},
number = {RUU-CS-89-19},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-19.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8725,
author = {Poutré, J.A.~La and Leeuwen, J.~van},
year = 1987,
title = {Maintenance of transitive closures and transitive reductions of graphs},
number = {RUU-CS-87-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-25.pdf}},
pubcat = {techreport}
}
webmaster@cs.uu.nl,
Wed, 19 Jun 2013 06:48:45 +0200
←
Departement Informatica, Universiteit Utrecht