Search the dblp DataBase
Oscar Garrido: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Krzysztof Diks, Oscar Garrido, Andrzej Lingas
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. [Citation Graph (0, 0)][DBLP]
ISA, 1991, pp:385-395 [Conf] - Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
A Simple Randomized Parallel Algorithm for Maximal f-Matching. [Citation Graph (0, 0)][DBLP]
LATIN, 1992, pp:165-176 [Conf] - Anders Dessmark, Andrzej Lingas, Oscar Garrido
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. [Citation Graph (0, 0)][DBLP]
MFCS, 1994, pp:316-325 [Conf] - Krzysztof Diks, Oscar Garrido, Andrzej Lingas
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:179-192 [Journal] - Anders Dessmark, Oscar Garrido, Andrzej Lingas
A Note on Parallel Complexity of Maximum f-Matching. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1998, v:65, n:2, pp:107-109 [Journal] - Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
A Simple Randomized Parallel Algorithm for Maximal f-Matchings. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1996, v:57, n:2, pp:83-87 [Journal] - Oscar Garrido, Pierre Kelsen, Andrzej Lingas
A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1996, v:58, n:2, pp:55-58 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002