Finding Maximal Pairs with Bounded Gap

Brodal GS, Lyngsø RB, Pedersen CNS, Stoye J (1999) Report.
BRICS, Department of Computer Science, University of Aarhus.

Report | Englisch
 
Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Autor/in
; ; ;
Erscheinungsjahr
1999
Page URI
https://pub.uni-bielefeld.de/record/1970509

Zitieren

Brodal GS, Lyngsø RB, Pedersen CNS, Stoye J. Finding Maximal Pairs with Bounded Gap. Report. BRICS, Department of Computer Science, University of Aarhus; 1999.
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S., & Stoye, J. (1999). Finding Maximal Pairs with Bounded Gap (Report). BRICS, Department of Computer Science, University of Aarhus.
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S., and Stoye, J. (1999). Finding Maximal Pairs with Bounded Gap. Report, BRICS, Department of Computer Science, University of Aarhus.
Brodal, G.S., et al., 1999. Finding Maximal Pairs with Bounded Gap, Report, BRICS, Department of Computer Science, University of Aarhus.
G.S. Brodal, et al., Finding Maximal Pairs with Bounded Gap, Report, BRICS, Department of Computer Science, University of Aarhus: 1999.
Brodal, G.S., Lyngsø, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gap. Report. BRICS, Department of Computer Science, University of Aarhus (1999).
Brodal, Gerth S., Lyngsø, Rune B., Pedersen, Christian N. S., and Stoye, Jens. Finding Maximal Pairs with Bounded Gap. BRICS, Department of Computer Science, University of Aarhus, 1999. Report.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar