Journal of Algorithms
, Volume 62
Volume 62, Number 1, January 2007
Tomás Feder
,
Rajeev Motwani
,
Liadan O'Callaghan
,
Chris Olston
,
Rina Panigrahy
:
Computing shortest paths with uncertainty.
1-18
Electronic Edition
(link)
BibTeX
Amin Coja-Oghlan
:
Solving NP-hard semirandom graph problems in polynomial expected time.
19-46
Electronic Edition
(link)
BibTeX
Volume 62, Number 2, April 2007
Surender Baswana
,
Ramesh Hariharan
,
Sandeep Sen
:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.
74-92
Electronic Edition
(link)
BibTeX
Sergio Cabello
:
Approximation algorithms for spreading points.
49-73
Electronic Edition
(link)
BibTeX
Volume 62, Numbers 3-4, July-October 2007
Christiano Braga
:
Special issue: LSFA'06.
93-94
Electronic Edition
(link)
BibTeX
Narciso Martí-Oliet
,
Miguel Palomino
,
Alberto Verdejo
:
Strategies and simulations in a semantic framework.
95-116
Electronic Edition
(link)
BibTeX
Cláudia Nalon
,
Clare Dixon
:
Clausal resolution for normal modal logics.
117-134
Electronic Edition
(link)
BibTeX
Benjamín René Callejas Bedregal
:
A normal form which preserves tautologies and contradictions in a class of fuzzy logics.
135-147
Electronic Edition
(link)
BibTeX
Robson da Luz
,
Mirian Halfeld Ferrari Alves
,
Martin A. Musicante
:
Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator).
148-167
Electronic Edition
(link)
BibTeX
Copyright ©
Sun May 17 00:06:12 2009 by
Michael Ley
(
ley@uni-trier.de
)