Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Loana Tito Nogueira

◀ ▶ joint publications with Eduardo Sany Laber

> Home > Persons > Loana Tito Nogueira

Publications

2008
[e1]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/2008
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/2008
Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luérbio Faria:
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings. Lecture Notes in Computer Science 4957, Springer 2008, ISBN 978-3-540-78772-3 [contents]
2007
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/CostaHLN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/CostaHLN07
Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira:
A note on the size of minimal covers. Inf. Process. Lett. 102(2-3): 124-126 (2007)
2004
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/LaberN04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/LaberN04
Eduardo Sany Laber, Loana Tito Nogueira:
On the hardness of the minimum height decision tree problem. Discret. Appl. Math. 144(1-2): 209-212 (2004)
2001
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/LaberN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/LaberN01
Eduardo Sany Laber, Loana Tito Nogueira:
Fast Searching in Trees. Electron. Notes Discret. Math. 7: 90-93 (2001)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.