Inscriere cercetatori

Daca aveti cont Ad Astra si de Facebook, intrati pe pagina de profil pentru a da dreptul sa va logati pe site doar cu acest buton.

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa old.ad-astra.ro

Facebook

The Maximum Binary Tree Problem

Autori: K. Chandrasekaran, E. Grigorescu, G. Istrate, S. Kulkarni, Y.-S. Lin, M. Zhu

Editorial: LIPICS, Leibniz Proceedings in Computer Science, Proceedings of the 28th European Symposium on Algorithms (ESA'2020), (to appear), 2020.

Rezumat:

Want create site? Find Free WordPress Themes and plugins.
Did you find apk for android? You can find new Free Android Games and apps.

URL: https://www.dagstuhl.de/en/publications/lipics