Finding Maximal Pairs with Bounded Gap
Brodal GS, Lyngsø RB, Pedersen CNS, Stoye J (2000)
In: Matching Patterns (Journal of Discrete Algorithms). Crochemore M, Gąsieniec L (Eds); 77-104.
Sammelwerksbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Brodal, Gerth S.;
Lyngsø, Rune B.;
Pedersen, Christian N. S.;
Stoye, JensUniBi 
Herausgeber*in
Crochemore, Maxime;
Gąsieniec, Leszek
Einrichtung
Erscheinungsjahr
2000
Buchtitel
Matching Patterns (Journal of Discrete Algorithms)
Seite(n)
77-104
Page URI
https://pub.uni-bielefeld.de/record/1918817
Zitieren
Brodal GS, Lyngsø RB, Pedersen CNS, Stoye J. Finding Maximal Pairs with Bounded Gap. In: Crochemore M, Gąsieniec L, eds. Matching Patterns (Journal of Discrete Algorithms). 2000: 77-104.
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S., & Stoye, J. (2000). Finding Maximal Pairs with Bounded Gap. In M. Crochemore & L. Gąsieniec (Eds.), Matching Patterns (Journal of Discrete Algorithms) (pp. 77-104).
Brodal, Gerth S., Lyngsø, Rune B., Pedersen, Christian N. S., and Stoye, Jens. 2000. “Finding Maximal Pairs with Bounded Gap”. In Matching Patterns (Journal of Discrete Algorithms), ed. Maxime Crochemore and Leszek Gąsieniec, 77-104.
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S., and Stoye, J. (2000). “Finding Maximal Pairs with Bounded Gap” in Matching Patterns (Journal of Discrete Algorithms), Crochemore, M., and Gąsieniec, L. eds. 77-104.
Brodal, G.S., et al., 2000. Finding Maximal Pairs with Bounded Gap. In M. Crochemore & L. Gąsieniec, eds. Matching Patterns (Journal of Discrete Algorithms). pp. 77-104.
G.S. Brodal, et al., “Finding Maximal Pairs with Bounded Gap”, Matching Patterns (Journal of Discrete Algorithms), M. Crochemore and L. Gąsieniec, eds., 2000, pp.77-104.
Brodal, G.S., Lyngsø, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gap. In: Crochemore, M. and Gąsieniec, L. (eds.) Matching Patterns (Journal of Discrete Algorithms). p. 77-104. (2000).
Brodal, Gerth S., Lyngsø, Rune B., Pedersen, Christian N. S., and Stoye, Jens. “Finding Maximal Pairs with Bounded Gap”. Matching Patterns (Journal of Discrete Algorithms). Ed. Maxime Crochemore and Leszek Gąsieniec. 2000. 77-104.
Google Scholar