default search action
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 - Amin Coja-Oghlan:
Solving NP-hard semirandom graph problems in polynomial expected time. 19-46
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 - Sergio Cabello:
Approximation algorithms for spreading points. 49-73
Volume 62, Numbers 3-4, July-October 2007
- Christiano Braga:
Special issue: LSFA'06. 93-94 - Narciso Martí-Oliet, Miguel Palomino, Alberto Verdejo:
Strategies and simulations in a semantic framework. 95-116 - Cláudia Nalon, Clare Dixon:
Clausal resolution for normal modal logics. 117-134 - Benjamín René Callejas Bedregal:
A normal form which preserves tautologies and contradictions in a class of fuzzy logics. 135-147 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.