Oscar Garrido

According to our database, Oscar Garrido authored at least 6 papers between 1992 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

A Note on Parallel Complexity of Maximum <i>f</i>-Matching.

Anders Dessmark, Oscar Garrido, Andrzej Lingas

Inf. Process. Lett., 1998

1996

A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity.

Oscar Garrido, Pierre Kelsen, Andrzej Lingas

Inf. Process. Lett., 1996

A Simple Randomized Parallel Algorithm for Maximal f-Matchings.

Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter

Inf. Process. Lett., 1996

1994

On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.

Anders Dessmark, Andrzej Lingas, Oscar Garrido

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993

Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.

Krzysztof Diks, Oscar Garrido, Andrzej Lingas

Int. J. Found. Comput. Sci., 1993

1992

A Simple Randomized Parallel Algorithm for Maximal <i>f</i>-Matching.

Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter

Proceedings of the LATIN '92, 1992