Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Eduardo Sany Laber
@article{DBLP:journals/ipl/Laber24,
author = {Eduardo Sany Laber},
title = {The computational complexity of some explainable clustering problems},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106437},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106437},
doi = {10.1016/J.IPL.2023.106437},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Laber24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-07091,
author = {Eduardo Sany Laber and
Lucas Murtinho},
title = {Optimization of Inter-group Criteria for Clustering with Minimum Size
Constraints},
journal = {CoRR},
volume = {abs/2401.07091},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.07091},
doi = {10.48550/ARXIV.2401.07091},
eprinttype = {arXiv},
eprint = {2401.07091},
timestamp = {Thu, 01 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-07091.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/LaberMO23,
author = {Eduardo Sany Laber and
Lucas Murtinho and
Felipe Oliveira},
title = {Shallow decision trees for explainable k-means clustering},
journal = {Pattern Recognit.},
volume = {137},
pages = {109239},
year = {2023},
url = {https://doi.org/10.1016/j.patcog.2022.109239},
doi = {10.1016/J.PATCOG.2022.109239},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pr/LaberMO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/FreitasLLM23,
author = {S{\'{e}}rgio Freitas and
Eduardo Sany Laber and
Pedro Lazera and
Marco Molinaro},
title = {Time-constrained learning},
journal = {Pattern Recognit.},
volume = {142},
pages = {109672},
year = {2023},
url = {https://doi.org/10.1016/j.patcog.2023.109672},
doi = {10.1016/J.PATCOG.2023.109672},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pr/FreitasLLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LaberM23,
author = {Eduardo Sany Laber and
Lucas Murtinho},
title = {Nearly tight bounds on the price of explainability for the \emph{k}-center
and the maximum-spacing clustering problems},
journal = {Theor. Comput. Sci.},
volume = {949},
pages = {113744},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113744},
doi = {10.1016/J.TCS.2023.113744},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LaberM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bracis/PavanelliGFPL23,
author = {Lucas Pavanelli and
Yohan Bonescki Gumiel and
Thiago Castro Ferreira and
Adriana S. Pagano and
Eduardo Sany Laber},
editor = {Murilo Coelho Naldi and
Reinaldo A. C. Bianchi},
title = {Bete: {A} Brazilian Portuguese Dataset for Named Entity Recognition
and Relation Extraction in the Diabetes Healthcare Domain},
booktitle = {Intelligent Systems - 12th Brazilian Conference, {BRACIS} 2023, Belo
Horizonte, Brazil, September 25-29, 2023, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {14197},
pages = {256--267},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-45392-2\_17},
doi = {10.1007/978-3-031-45392-2\_17},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bracis/PavanelliGFPL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/LaberM23,
author = {Eduardo Sany Laber and
Lucas Murtinho},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Optimization of Inter-group criteria for clustering with minimum size
constraints},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/20f814ecdaa8c76131e21683447e347b-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/LaberM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/SouzaCLM22,
author = {Victor Feitosa Souza and
Ferdinando Cicalese and
Eduardo Sany Laber and
Marco Molinaro},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Decision Trees with Short Explainable Rules},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/500637d931d4feb99d5cce84af1f53ba-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/SouzaCLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-01913,
author = {Sergio Filho and
Eduardo Sany Laber and
Pedro Lazera and
Marco Molinaro},
title = {Time-Constrained Learning},
journal = {CoRR},
volume = {abs/2202.01913},
year = {2022},
url = {https://arxiv.org/abs/2202.01913},
eprinttype = {arXiv},
eprint = {2202.01913},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-01913.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-09643,
author = {Eduardo Sany Laber},
title = {The computational complexity of some explainable clustering problems},
journal = {CoRR},
volume = {abs/2208.09643},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.09643},
doi = {10.48550/ARXIV.2208.09643},
eprinttype = {arXiv},
eprint = {2208.09643},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-09643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CicaleseL21,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
title = {On the star decomposition of a graph: Hardness results and approximation
for the max-min optimization problem},
journal = {Discret. Appl. Math.},
volume = {289},
pages = {503--515},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.07.014},
doi = {10.1016/J.DAM.2020.07.014},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CicaleseL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/CicaleseL21,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
title = {Information Theoretical Clustering Is Hard to Approximate},
journal = {{IEEE} Trans. Inf. Theory},
volume = {67},
number = {1},
pages = {586--597},
year = {2021},
url = {https://doi.org/10.1109/TIT.2020.3031629},
doi = {10.1109/TIT.2020.3031629},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/CicaleseL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LaberM21,
author = {Eduardo Sany Laber and
Lucas Murtinho},
editor = {Marina Meila and
Tong Zhang},
title = {On the price of explainability for some clustering problems},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {5915--5925},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/laber21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/LaberM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-01576,
author = {Eduardo Sany Laber and
Lucas Murtinho},
title = {On the price of explainability for some clustering problems},
journal = {CoRR},
volume = {abs/2101.01576},
year = {2021},
url = {https://arxiv.org/abs/2101.01576},
eprinttype = {arXiv},
eprint = {2101.01576},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-01576.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-14718,
author = {Eduardo Sany Laber and
Lucas Murtinho and
Felipe Oliveira},
title = {Shallow decision trees for explainable k-means clustering},
journal = {CoRR},
volume = {abs/2112.14718},
year = {2021},
url = {https://arxiv.org/abs/2112.14718},
eprinttype = {arXiv},
eprint = {2112.14718},
timestamp = {Wed, 05 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-14718.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/WernerL20,
author = {Matheus Werner and
Eduardo Sany Laber},
editor = {Giuseppe De Giacomo and
Alejandro Catal{\'{a}} and
Bistra Dilkina and
Michela Milano and
Sen{\'{e}}n Barro and
Alberto Bugar{\'{\i}}n and
J{\'{e}}r{\^{o}}me Lang},
title = {Speeding up Word Mover's Distance and Its Variants via Properties
of Distances Between Embeddings},
booktitle = {{ECAI} 2020 - 24th European Conference on Artificial Intelligence,
29 August-8 September 2020, Santiago de Compostela, Spain, August
29 - September 8, 2020 - Including 10th Conference on Prestigious
Applications of Artificial Intelligence {(PAIS} 2020)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {325},
pages = {2204--2211},
publisher = {{IOS} Press},
year = {2020},
url = {https://doi.org/10.3233/FAIA200346},
doi = {10.3233/FAIA200346},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/WernerL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CicaleseFLM20,
author = {Ferdinando Cicalese and
Sergio Filho and
Eduardo Sany Laber and
Marco Molinaro},
title = {Teaching with Limited Information on the Learner's Behaviour},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {2016--2026},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/cicalese20a.html},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/CicaleseFLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CicaleseLM19,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Lucas Murtinho},
editor = {Kamalika Chaudhuri and
Ruslan Salakhutdinov},
title = {New results on information theoretic clustering},
booktitle = {Proceedings of the 36th International Conference on Machine Learning,
{ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {97},
pages = {1242--1251},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v97/cicalese19a.html},
timestamp = {Tue, 11 Jun 2019 15:37:38 +0200},
biburl = {https://dblp.org/rec/conf/icml/CicaleseLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/LaberM19,
author = {Eduardo Sany Laber and
Lucas Murtinho},
editor = {Gabriel Coutinho and
Yoshiharu Kohayakawa and
Vin{\'{\i}}cius Fernandes dos Santos and
Sebasti{\'{a}}n Urrutia},
title = {Minimization of Gini Impurity: NP-completeness and Approximation Algorithm
via Connections with the k-means Problem},
booktitle = {Proceedings of the tenth Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2019, Belo Horizonte, Brazil, June
2-7, 2019},
series = {Electronic Notes in Theoretical Computer Science},
volume = {346},
pages = {567--576},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.entcs.2019.08.050},
doi = {10.1016/J.ENTCS.2019.08.050},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/LaberM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-00509,
author = {Matheus Werner and
Eduardo Sany Laber},
title = {Speeding up Word Mover's Distance and its variants via properties
of distances between embeddings},
journal = {CoRR},
volume = {abs/1912.00509},
year = {2019},
url = {http://arxiv.org/abs/1912.00509},
eprinttype = {arXiv},
eprint = {1912.00509},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-00509.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaettlerLC18,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Correction to: Trading Off Worst and Expected Cost in Decision Tree
Problems},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3431--3436},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0423-8},
doi = {10.1007/S00453-018-0423-8},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaettlerLC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/LaberP18,
author = {Eduardo Sany Laber and
Felipe de A. Mello Pereira},
title = {Splitting criteria for classification problems with multi-valued attributes
and large number of classes},
journal = {Pattern Recognit. Lett.},
volume = {111},
pages = {58--63},
year = {2018},
url = {https://doi.org/10.1016/j.patrec.2018.04.013},
doi = {10.1016/J.PATREC.2018.04.013},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/prl/LaberP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LaberMP18,
author = {Eduardo Sany Laber and
Marco Molinaro and
Felipe de A. Mello Pereira},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Binary Partitions with Approximate Minimum Impurity},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {2860--2868},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/laber18a.html},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/LaberMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05241,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
title = {Approximation Algorithms for Clustering via Weighted Impurity Measures},
journal = {CoRR},
volume = {abs/1807.05241},
year = {2018},
url = {http://arxiv.org/abs/1807.05241},
eprinttype = {arXiv},
eprint = {1807.05241},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05241.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-00029,
author = {Eduardo Sany Laber and
Lucas Murtinho},
title = {Minimization of Gini impurity via connections with the k-means problem},
journal = {CoRR},
volume = {abs/1810.00029},
year = {2018},
url = {http://arxiv.org/abs/1810.00029},
eprinttype = {arXiv},
eprint = {1810.00029},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-00029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-07075,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
title = {Information theoretical clustering is hard to approximate},
journal = {CoRR},
volume = {abs/1812.07075},
year = {2018},
url = {http://arxiv.org/abs/1812.07075},
eprinttype = {arXiv},
eprint = {1812.07075},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-07075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CicaleseLS17,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Aline Medeiros Saettler},
title = {Decision Trees for Function Evaluation: Simultaneous Optimization
of Worst and Expected Cost},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {763--796},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0225-9},
doi = {10.1007/S00453-016-0225-9},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CicaleseLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaettlerLC17,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Trading Off Worst and Expected Cost in Decision Tree Problems},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {886--908},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0211-2},
doi = {10.1007/S00453-016-0211-2},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaettlerLC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gandc/MouraLLMPJTP17,
author = {Pedro Moura and
Eduardo Sany Laber and
H{\'{e}}lio Lopes and
Daniel Mesejo and
Lucas Pavanelli and
Jo{\~{a}}o Jardim and
Francisco Thiesen and
Gabriel Pujol},
title = {{LSHSIM:} {A} Locality Sensitive Hashing based method for multiple-point
geostatistics},
journal = {Comput. Geosci.},
volume = {107},
pages = {49--60},
year = {2017},
url = {https://doi.org/10.1016/j.cageo.2017.06.013},
doi = {10.1016/J.CAGEO.2017.06.013},
timestamp = {Thu, 20 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gandc/MouraLLMPJTP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SaettlerLP17,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Felipe de A. Mello Pereira},
title = {Decision tree classification with bounded number of errors},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {27--31},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.011},
doi = {10.1016/J.IPL.2017.06.011},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SaettlerLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/LaberMP16,
author = {Eduardo Sany Laber and
Pedro Moura and
Lucas Pavanelli},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {On Compression Techniques for Computing Convolutions},
booktitle = {2016 Data Compression Conference, {DCC} 2016, Snowbird, UT, USA, March
30 - April 1, 2016},
pages = {359--368},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/DCC.2016.82},
doi = {10.1109/DCC.2016.82},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/dcc/LaberMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SaettlerLC15,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Approximating decision trees with value dependent testing costs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {594--599},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.006},
doi = {10.1016/J.IPL.2015.02.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SaettlerLC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/SaettlerLC15,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Trading off Worst and Expected Cost in Decision Tree Problems},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {223--234},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_20},
doi = {10.1007/978-3-662-48971-0\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/SaettlerLC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RoncallaLC15,
author = {Wilfredo Bardales Roncalla and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Searching for a superlinear lower bounds for the Maximum Consecutive
Subsums Problem and the (min, +)-convolution},
journal = {CoRR},
volume = {abs/1509.05445},
year = {2015},
url = {http://arxiv.org/abs/1509.05445},
eprinttype = {arXiv},
eprint = {1509.05445},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RoncallaLC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CicaleseJLM14,
author = {Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Sany Laber and
Marco Molinaro},
title = {Improved Approximation Algorithms for the Average-Case Tree Searching
Problem},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {1045--1074},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9715-6},
doi = {10.1007/S00453-012-9715-6},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CicaleseJLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CicaleseLWY14,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Oren Weimann and
Raphael Yuster},
title = {Approximating the maximum consecutive subsums of a sequence},
journal = {Theor. Comput. Sci.},
volume = {525},
pages = {130--137},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.05.032},
doi = {10.1016/J.TCS.2013.05.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CicaleseLWY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CicaleseLS14,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Aline Medeiros Saettler},
title = {Diagnosis determination: decision trees optimizing simultaneously
worst and expected testing cost},
booktitle = {Proceedings of the 31th International Conference on Machine Learning,
{ICML} 2014, Beijing, China, 21-26 June 2014},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {32},
pages = {414--422},
publisher = {JMLR.org},
year = {2014},
url = {http://proceedings.mlr.press/v32/cicalese14.html},
timestamp = {Wed, 29 May 2019 08:41:45 +0200},
biburl = {https://dblp.org/rec/conf/icml/CicaleseLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/CicaleseLS14,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Aline Medeiros Saettler},
title = {Function Evaluation: decision trees optimizing simultaneously worst
and expected testing cost},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2014, Fort Lauderdale, FL, USA, January 6-8, 2014},
year = {2014},
url = {http://www.cs.uic.edu/pub/Isaim2014/WebPreferences/ISAIM2014\_Boolean\_Cicalese\_etal.pdf},
timestamp = {Wed, 20 Mar 2024 17:48:47 +0100},
biburl = {https://dblp.org/rec/conf/isaim/CicaleseLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/LaberRC14,
author = {Eduardo Sany Laber and
Wilfredo Bardales Roncalla and
Ferdinando Cicalese},
title = {On lower bounds for the Maximum Consecutive Subsums Problem and the
(min, +)-convolution},
booktitle = {2014 {IEEE} International Symposium on Information Theory, Honolulu,
HI, USA, June 29 - July 4, 2014},
pages = {1807--1811},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ISIT.2014.6875145},
doi = {10.1109/ISIT.2014.6875145},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/LaberRC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SaettlerLC14,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Trading off Worst and Expected Cost in Decision Tree Problems and
a Value Dependent Model},
journal = {CoRR},
volume = {abs/1406.3655},
year = {2014},
url = {http://arxiv.org/abs/1406.3655},
eprinttype = {arXiv},
eprint = {1406.3655},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SaettlerLC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CicaleseGGLLRT13,
author = {Ferdinando Cicalese and
Travis Gagie and
Emanuele Giaquinta and
Eduardo Sany Laber and
Zsuzsanna Lipt{\'{a}}k and
Romeo Rizzi and
Alexandru I. Tomescu},
editor = {Oren Kurland and
Moshe Lewenstein and
Ely Porat},
title = {Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs},
booktitle = {String Processing and Information Retrieval - 20th International Symposium,
{SPIRE} 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8214},
pages = {56--63},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-02432-5\_10},
doi = {10.1007/978-3-319-02432-5\_10},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/CicaleseGGLLRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5560,
author = {Ferdinando Cicalese and
Travis Gagie and
Emanuele Giaquinta and
Eduardo Sany Laber and
Zsuzsanna Lipt{\'{a}}k and
Romeo Rizzi and
Alexandru I. Tomescu},
title = {Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs},
journal = {CoRR},
volume = {abs/1304.5560},
year = {2013},
url = {http://arxiv.org/abs/1304.5560},
eprinttype = {arXiv},
eprint = {1304.5560},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5560.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CicaleseLS13,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Aline Medeiros Saettler},
title = {Decision Trees for the efficient evaluation of discrete functions:
worst case and expected case analysis},
journal = {CoRR},
volume = {abs/1309.2796},
year = {2013},
url = {http://arxiv.org/abs/1309.2796},
eprinttype = {arXiv},
eprint = {1309.2796},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CicaleseLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CicaleseJLV12,
author = {Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Sany Laber and
Caio Dias Valentim},
title = {The binary identification problem for weighted trees},
journal = {Theor. Comput. Sci.},
volume = {459},
pages = {100--112},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.06.023},
doi = {10.1016/J.TCS.2012.06.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CicaleseJLV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CicaleseLWY12,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Oren Weimann and
Raphael Yuster},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Near Linear Time Construction of an Approximate Index for All Maximum
Consecutive Sub-sums of a Sequence},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {149--158},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_12},
doi = {10.1007/978-3-642-31265-6\_12},
timestamp = {Tue, 21 Mar 2023 21:02:12 +0100},
biburl = {https://dblp.org/rec/conf/cpm/CicaleseLWY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkdd/ValentimLS12,
author = {Caio Dias Valentim and
Eduardo Sany Laber and
David Sotelo},
editor = {Peter A. Flach and
Tijl De Bie and
Nello Cristianini},
title = {Data Structures for Detecting Rare Variations in Time Series},
booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference,
{ECML} {PKDD} 2012, Bristol, UK, September 24-28, 2012. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7524},
pages = {709--724},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33486-3\_45},
doi = {10.1007/978-3-642-33486-3\_45},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/pkdd/ValentimLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LaberBF11,
author = {Eduardo Sany Laber and
Claudson F. Bornstein and
Cristina G. Fernandes},
title = {Guest Editorial: Special Issue on Latin American Theoretical Informatics
Symposium {(LATIN)}},
journal = {Algorithmica},
volume = {59},
number = {1},
pages = {1--2},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9473-2},
doi = {10.1007/S00453-010-9473-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LaberBF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LaberM11,
author = {Eduardo Sany Laber and
Marco Molinaro},
title = {An Approximation Algorithm for Binary Searching in Trees},
journal = {Algorithmica},
volume = {59},
number = {4},
pages = {601--620},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9325-0},
doi = {10.1007/S00453-009-9325-0},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LaberM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CicaleseGLM11,
author = {Ferdinando Cicalese and
Travis Gagie and
Eduardo Sany Laber and
Martin Milanic},
title = {Competitive Boolean function evaluation: Beyond monotonicity, and
the symmetric case},
journal = {Discret. Appl. Math.},
volume = {159},
number = {11},
pages = {1070--1078},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.05.016},
doi = {10.1016/J.DAM.2010.05.016},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CicaleseGLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CicaleseL11,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
title = {On the competitive ratio of evaluating priced functions},
journal = {J. {ACM}},
volume = {58},
number = {3},
pages = {9:1--9:40},
year = {2011},
url = {https://doi.org/10.1145/1970392.1970393},
doi = {10.1145/1970392.1970393},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CicaleseL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LaberM11,
author = {Eduardo Sany Laber and
Marco Molinaro},
title = {Improved approximations for the hotlink assignment problem},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {3},
pages = {39:1--39:34},
year = {2011},
url = {https://doi.org/10.1145/1978782.1978794},
doi = {10.1145/1978782.1978794},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/LaberM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CicaleseJLM11,
author = {Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Sany Laber and
Marco Molinaro},
title = {On the complexity of searching in trees and partially ordered structures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6879--6896},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.042},
doi = {10.1016/J.TCS.2011.08.042},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CicaleseJLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/doceng/CardosoJLRC11,
author = {Eduardo Teixeira Cardoso and
Iam Vita Jabour and
Eduardo Sany Laber and
Rog{\'{e}}rio Rodrigues and
Pedro Cardoso},
editor = {Matthew R. B. Hardy and
Frank Wm. Tompa},
title = {An efficient language-independent method to extract content from news
webpages},
booktitle = {Proceedings of the 2011 {ACM} Symposium on Document Engineering, Mountain
View, CA, USA, September 19-22, 2011},
pages = {121--128},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2034691.2034720},
doi = {10.1145/2034691.2034720},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/doceng/CardosoJLRC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CicaleseJLV11,
author = {Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Sany Laber and
Caio Dias Valentim},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Binary Identification Problems for Weighted Trees},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {255--266},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_22},
doi = {10.1007/978-3-642-22300-6\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/CicaleseJLV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JacobsCLM10,
author = {Tobias Jacobs and
Ferdinando Cicalese and
Eduardo Sany Laber and
Marco Molinaro},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {On the Complexity of Searching in Trees: Average-Case Minimization},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {527--539},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_45},
doi = {10.1007/978-3-642-14165-2\_45},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/JacobsCLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CicaleseJLM10,
author = {Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Sany Laber and
Marco Molinaro},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {On Greedy Algorithms for Decision Trees},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {206--217},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_18},
doi = {10.1007/978-3-642-17514-5\_18},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/CicaleseJLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-4136,
author = {Ferdinando Cicalese and
Travis Gagie and
Eduardo Sany Laber and
Martin Milanic},
title = {Competitive Boolean Function Evaluation: Beyond Monotonicity, and
the Symmetric Case},
journal = {CoRR},
volume = {abs/1006.4136},
year = {2010},
url = {http://arxiv.org/abs/1006.4136},
eprinttype = {arXiv},
eprint = {1006.4136},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-4136.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/LaberSJACRTV09,
author = {Eduardo Sany Laber and
Cr{\'{\i}}ston Pereira de Souza and
Iam Vita Jabour and
Evelin Carvalho Freire de Amorim and
Eduardo Teixeira Cardoso and
Ra{\'{u}}l P. Renter{\'{\i}}a and
L{\'{u}}cio Cunha Tinoco and
Caio Dias Valentim},
editor = {David Wai{-}Lok Cheung and
Il{-}Yeol Song and
Wesley W. Chu and
Xiaohua Hu and
Jimmy Lin},
title = {A fast and simple method for extracting relevant content from news
webpages},
booktitle = {Proceedings of the 18th {ACM} Conference on Information and Knowledge
Management, {CIKM} 2009, Hong Kong, China, November 2-6, 2009},
pages = {1685--1688},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1645953.1646204},
doi = {10.1145/1645953.1646204},
timestamp = {Fri, 27 Aug 2021 11:13:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/LaberSJACRTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/AvilaL09,
author = {Bruno Ten{\'{o}}rio {\'{A}}vila and
Eduardo Sany Laber},
title = {Merge source coding},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2009,
June 28 - July 3, 2009, Seoul, Korea, Proceedings},
pages = {214--218},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ISIT.2009.5205774},
doi = {10.1109/ISIT.2009.5205774},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/AvilaL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-3503,
author = {Ferdinando Cicalese and
Eduardo Sany Laber and
Marco Molinaro},
title = {On the Complexity of Searching in Trees: Average-case Minimization},
journal = {CoRR},
volume = {abs/0904.3503},
year = {2009},
url = {http://arxiv.org/abs/0904.3503},
eprinttype = {arXiv},
eprint = {0904.3503},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-3503.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Laber08,
author = {Eduardo Sany Laber},
title = {A randomized competitive algorithm for evaluating priced {AND/OR}
trees},
journal = {Theor. Comput. Sci.},
volume = {401},
number = {1-3},
pages = {120--130},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.03.033},
doi = {10.1016/J.TCS.2008.03.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Laber08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CicaleseL08,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Function Evaluation Via Linear Programming in the Priced Information
Model},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {173--185},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_15},
doi = {10.1007/978-3-540-70575-8\_15},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CicaleseL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LaberM08,
author = {Eduardo Sany Laber and
Marco Molinaro},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {An Approximation Algorithm for Binary Searching in Trees},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {459--471},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_38},
doi = {10.1007/978-3-540-70575-8\_38},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/LaberM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2008,
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0},
doi = {10.1007/978-3-540-78773-0},
isbn = {978-3-540-78772-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CostaHLN07,
author = {Vaston G. Costa and
Edward Hermann Haeusler and
Eduardo Sany Laber and
Loana Tito Nogueira},
title = {A note on the size of minimal covers},
journal = {Inf. Process. Lett.},
volume = {102},
number = {2-3},
pages = {124--126},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.10.012},
doi = {10.1016/J.IPL.2006.10.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CostaHLN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarmoFKLMOPT07,
author = {Renato Carmo and
Tom{\'{a}}s Feder and
Yoshiharu Kohayakawa and
Eduardo Sany Laber and
Rajeev Motwani and
Liadan O'Callaghan and
Rina Panigrahy and
Dilys Thomas},
title = {Querying priced information in databases: The conjunctive case},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {1},
pages = {9:1--9:22},
year = {2007},
url = {https://doi.org/10.1145/1219944.1219955},
doi = {10.1145/1219944.1219955},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CarmoFKLMOPT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tois/GerstelKLMPPS07,
author = {Ornan Ori Gerstel and
Shay Kutten and
Eduardo Sany Laber and
Rachel Matichin and
David Peleg and
Artur Alves Pessoa and
Cr{\'{\i}}ston P. de Souza},
title = {Reducing human interactions in Web directory searches},
journal = {{ACM} Trans. Inf. Syst.},
volume = {25},
number = {4},
pages = {20},
year = {2007},
url = {https://doi.org/10.1145/1281485.1281491},
doi = {10.1145/1281485.1281491},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tois/GerstelKLMPPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/la-web/SouzaLVC07,
author = {Cr{\'{\i}}ston P. de Souza and
Eduardo Sany Laber and
Caio Dias Valentim and
Eduardo Teixeira Cardoso},
editor = {Virg{\'{\i}}lio A. F. Almeida and
Ricardo A. Baeza{-}Yates},
title = {A Polite Policy for Revisiting Web Pages},
booktitle = {Fifth Latin American Web Congress (LA-Web 2007), 31 October - 2 November
2007, Santiago de Chile},
pages = {128--135},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.ieeecomputersociety.org/10.1109/LA-WEB.2007.55},
doi = {10.1109/LA-WEB.2007.55},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/la-web/SouzaLVC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gtitc/Laber06,
author = {Eduardo Sany Laber},
editor = {Rudolf Ahlswede and
Lars B{\"{a}}umer and
Ning Cai and
Harout K. Aydinian and
Vladimir M. Blinovsky and
Christian Deppe and
Haik Mashurian},
title = {Hotlink Assignment on the Web},
booktitle = {General Theory of Information Transfer and Combinatorics},
series = {Lecture Notes in Computer Science},
volume = {4123},
pages = {1088--1092},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11889342\_77},
doi = {10.1007/11889342\_77},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/gtitc/Laber06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BornsteinLM06,
author = {Claudson F. Bornstein and
Eduardo Sany Laber and
Marcelo Mas},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand
Auctions},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {211--223},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_23},
doi = {10.1007/11682462\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BornsteinLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CicaleseL06,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
title = {On the competitive ratio of evaluating priced functions},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {944--953},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109661},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CicaleseL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BornsteinLM05,
author = {Claudson F. Bornstein and
Eduardo Sany Laber and
Marcelo Albuquerque Fernandes M{\'{a}}s},
title = {Randomized mechanisms for limited supply multi-item auctions},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {141--147},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.020},
doi = {10.1016/J.ENDM.2005.05.020},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BornsteinLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CicaleseL05,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {An Optimal Algorithm for Querying Priced Information: Monotone Boolean
Functions and Game Trees},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {664--676},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_59},
doi = {10.1007/11561071\_59},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/CicaleseL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CicaleseL05,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {A new strategy for querying priced information},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {674--683},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060691},
doi = {10.1145/1060590.1060691},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CicaleseL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LaberN04,
author = {Eduardo Sany Laber and
Loana Tito Nogueira},
title = {On the hardness of the minimum height decision tree problem},
journal = {Discret. Appl. Math.},
volume = {144},
number = {1-2},
pages = {209--212},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2004.06.002},
doi = {10.1016/J.DAM.2004.06.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LaberN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CarmoDKL04,
author = {Renato Carmo and
Jair Donadelli and
Yoshiharu Kohayakawa and
Eduardo Sany Laber},
title = {Searching in random partially ordered sets},
journal = {Theor. Comput. Sci.},
volume = {321},
number = {1},
pages = {41--57},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.06.001},
doi = {10.1016/J.TCS.2003.06.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CarmoDKL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/PessoaLS04,
author = {Artur Alves Pessoa and
Eduardo Sany Laber and
Cr{\'{\i}}ston P. de Souza},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Efficient Implementation of Hotlink Assignment Algorithm for Web Sites},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {79--87},
publisher = {{SIAM}},
year = {2004},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/PessoaLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/PessoaLS04,
author = {Artur Alves Pessoa and
Eduardo Sany Laber and
Cr{\'{\i}}ston P. de Souza},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Efficient Algorithms for the Hotlink Assignment Problem: The Worst
Case Search},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {778--792},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_67},
doi = {10.1007/978-3-540-30551-4\_67},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/PessoaLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/LaberCK04,
author = {Eduardo Sany Laber and
Renato Carmo and
Yoshiharu Kohayakawa},
editor = {Martin Farach{-}Colton},
title = {Querying Priced Information in Databases: The Conjunctive Case},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2976},
pages = {6--15},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24698-5\_5},
doi = {10.1007/978-3-540-24698-5\_5},
timestamp = {Fri, 09 Apr 2021 18:42:35 +0200},
biburl = {https://dblp.org/rec/conf/latin/LaberCK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Laber04,
author = {Eduardo Sany Laber},
editor = {Volker Diekert and
Michel Habib},
title = {A Randomized Competitive Algorithm for Evaluating Priced {AND/OR}
Trees},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {501--512},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_44},
doi = {10.1007/978-3-540-24749-4\_44},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Laber04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/LaberC03,
author = {Eduardo Sany Laber and
Emerson L. Monte Carmelo},
title = {A Note on multicolor bipartite Ramsey numbers for K{\_}\{2, n\}},
journal = {Ars Comb.},
volume = {69},
year = {2003},
timestamp = {Tue, 02 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/LaberC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MilidiuPL03,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
title = {The complexity of makespan minimization for pipeline transportation},
journal = {Theor. Comput. Sci.},
volume = {306},
number = {1-3},
pages = {339--351},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00291-3},
doi = {10.1016/S0304-3975(03)00291-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MilidiuPL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/MilidiuLMD03,
author = {Ruy Luiz Milidi{\'{u}} and
Eduardo Sany Laber and
Lorenza O. Moreno and
Julio C. Duarte},
title = {A fast decoding method for prefix codes},
booktitle = {2003 Data Compression Conference {(DCC} 2003), 25-27 March 2003, Snowbird,
UT, {USA}},
pages = {438},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/DCC.2003.1194057},
doi = {10.1109/DCC.2003.1194057},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/MilidiuLMD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sbbd/PortoLV03,
author = {F{\'{a}}bio Porto and
Eduardo Sany Laber and
Patrick Valduriez},
editor = {Alberto H. F. Laender},
title = {Cherry Picking: {A} Semantic Query Processing Strategy for the Evaluation
of Expensive Predicates},
booktitle = {{XVIII} Simp{\'{o}}sio Brasileiro de Bancos de Dados, 6-8 de
Outubro, Manaus, Amazonas, Brasil, Anais/Proceedings},
pages = {356--370},
publisher = {{UFAM}},
year = {2003},
timestamp = {Fri, 04 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sbbd/PortoLV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaberH02,
author = {Eduardo Sany Laber and
Leonardo Gomes Holanda},
title = {Improved bounds for asymmetric communication protocols},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {205--209},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00332-5},
doi = {10.1016/S0020-0190(01)00332-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaberH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LaberMP02,
author = {Eduardo Sany Laber and
Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa},
title = {On Binary Searching with Nonuniform Costs},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {4},
pages = {1022--1047},
year = {2002},
url = {https://doi.org/10.1137/S0097539700381991},
doi = {10.1137/S0097539700381991},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LaberMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LaberMP02,
author = {Eduardo Sany Laber and
Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa},
title = {A strategy for searching with different access costs},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {571--584},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00262-6},
doi = {10.1016/S0304-3975(01)00262-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LaberMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MilidiuPL02,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
editor = {Klaus Jansen and
Stefano Leonardi and
Vijay V. Vazirani},
title = {Complexity of Makespan Minimization for Pipeline Transportation of
Petroleum Products},
booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International
Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2462},
pages = {243--255},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45753-4\_21},
doi = {10.1007/3-540-45753-4\_21},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/approx/MilidiuPL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LaberPR02,
author = {Eduardo Sany Laber and
Ojas Parekh and
R. Ravi},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Randomized Approximation Algorithms for Query Optimization Problems
on Two Processors},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {649--661},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_57},
doi = {10.1007/3-540-45749-6\_57},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/LaberPR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/MilidiuPL02,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
editor = {Sergio Rajsbaum},
title = {Pipeline Transportation of Petroleum Products with No Due Dates},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {248--262},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_25},
doi = {10.1007/3-540-45995-2\_25},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/MilidiuPL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CarmoDKL02,
author = {Renato Carmo and
Jair Donadelli and
Yoshiharu Kohayakawa and
Eduardo Sany Laber},
editor = {Sergio Rajsbaum},
title = {Searching in Random Partially Ordered Sets},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {278--292},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_27},
doi = {10.1007/3-540-45995-2\_27},
timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/CarmoDKL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MilidiuL01,
author = {Ruy Luiz Milidi{\'{u}} and
Eduardo Sany Laber},
title = {Bounding the Inefficiency of Length-Restricted Prefix Codes},
journal = {Algorithmica},
volume = {31},
number = {4},
pages = {513--529},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0060-4},
doi = {10.1007/S00453-001-0060-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MilidiuL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LaberH01,
author = {Eduardo Sany Laber and
Leonardo Gomes Holanda},
title = {On asymmetric communication protocols},
journal = {Electron. Notes Discret. Math.},
volume = {7},
pages = {6--9},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00211-2},
doi = {10.1016/S1571-0653(04)00211-2},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LaberH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LaberN01,
author = {Eduardo Sany Laber and
Loana Tito Nogueira},
title = {Fast Searching in Trees},
journal = {Electron. Notes Discret. Math.},
volume = {7},
pages = {90--93},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00232-X},
doi = {10.1016/S1571-0653(04)00232-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LaberN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MilidiuPL01,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
title = {Three space-economical algorithms for calculating minimum-redundancy
prefix codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {47},
number = {6},
pages = {2185--2198},
year = {2001},
url = {https://doi.org/10.1109/18.945242},
doi = {10.1109/18.945242},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/MilidiuPL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LaberMP01,
author = {Eduardo Sany Laber and
Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa},
editor = {S. Rao Kosaraju},
title = {On binary searching with non-uniform costs},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {855--864},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365796},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/LaberMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MilidiuL00,
author = {Ruy Luiz Milidi{\'{u}} and
Eduardo Sany Laber},
title = {The {WARM-UP} Algorithm: {A} Lagrangian Construction of Length Restricted
Huffman Codes},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1405--1426},
year = {2000},
url = {https://doi.org/10.1137/S009753979731981X},
doi = {10.1137/S009753979731981X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MilidiuL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/MilidiuL00,
author = {Ruy Luiz Milidi{\'{u}} and
Eduardo Sany Laber},
editor = {Gaston H. Gonnet and
Daniel Panario and
Alfredo Viola},
title = {Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended
Abstract)},
booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1776},
pages = {227--236},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10719839\_23},
doi = {10.1007/10719839\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/MilidiuL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/MilidiuPLR00,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber and
Ra{\'{u}}l P. Renter{\'{\i}}a},
editor = {Pablo de la Fuente},
title = {Fast Calculation of Optimal Strategies for Searching with Non-Uniform
Costs},
booktitle = {Seventh International Symposium on String Processing and Information
Retrieval, {SPIRE} 2000, {A} Coru{\~{n}}a, Spain, September 27-29,
2000},
pages = {229--235},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SPIRE.2000.878199},
doi = {10.1109/SPIRE.2000.878199},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/MilidiuPLR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Laber99,
author = {Eduardo Sany Laber},
title = {C{\'{o}}Digos de Prefixo: Algoritmos {E} Cotas},
school = {Pontifical Catholic University of Rio de Janeiro, Brazil},
year = {1999},
url = {http://www.maxwell.vrac.puc-rio.br/Busca\_etds.php?strSecao=resultado\&\#38;nrSeq=13809@1},
timestamp = {Mon, 31 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Laber99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MilidiuLP99,
author = {Ruy Luiz Milidi{\'{u}} and
Eduardo Sany Laber and
Artur Alves Pessoa},
title = {Bounding the Compression Loss of the {FGK} Algorithm},
journal = {J. Algorithms},
volume = {32},
number = {2},
pages = {195--211},
year = {1999},
url = {https://doi.org/10.1006/jagm.1999.1012},
doi = {10.1006/JAGM.1999.1012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/MilidiuLP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/MilidiuPL99,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
editor = {Michael T. Goodrich and
Catherine C. McGeoch},
title = {Efficient Implementation of the {WARM-UP} Algorithm for the Construction
of Length-Restricted Prefix Codes},
booktitle = {Algorithm Engineering and Experimentation, International Workshop
{ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {1619},
pages = {1--17},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48518-X\_1},
doi = {10.1007/3-540-48518-X\_1},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/alenex/MilidiuPL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/MiliduPL99,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
title = {Two Space-Economical Algorithms for Calculating Minimum Redundancy
Prefix Codes},
booktitle = {Data Compression Conference, {DCC} 1999, Snowbird, Utah, USA, March
29-31, 1999},
pages = {267--276},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/DCC.1999.755676},
doi = {10.1109/DCC.1999.755676},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/MiliduPL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/MiliduLP99,
author = {Ruy Luiz Milidi{\'{u}} and
Eduardo Sany Laber and
Artur Alves Pessoa},
title = {A Work Efficient Parallel Algorithm for Constructing Huffman Codes},
booktitle = {Data Compression Conference, {DCC} 1999, Snowbird, Utah, USA, March
29-31, 1999},
pages = {277--286},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/DCC.1999.755677},
doi = {10.1109/DCC.1999.755677},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/MiliduLP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/MiliduLP99a,
author = {Ruy Luiz Milidi{\'{u}} and
Eduardo Sany Laber and
Artur Alves Pessoa},
title = {Bounding the Compression Loss of the {FGK} Algorithm},
booktitle = {Data Compression Conference, {DCC} 1999, Snowbird, Utah, USA, March
29-31, 1999},
pages = {539},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/DCC.1999.785696},
doi = {10.1109/DCC.1999.785696},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/MiliduLP99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LaberMP99,
author = {Eduardo Sany Laber and
Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa},
editor = {Jaroslav Nesetril},
title = {Strategies for Searching with Different Access Costs},
booktitle = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech
Republic, July 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1643},
pages = {236--247},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48481-7\_21},
doi = {10.1007/3-540-48481-7\_21},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/LaberMP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/LaberMP99,
author = {Eduardo Sany Laber and
Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa},
editor = {Ricardo A. Baeza{-}Yates and
Edgar Ch{\'{a}}vez and
Jes{\'{u}}s Favela},
title = {Practical Constructions of L-restricted Alphabetic Prefix Codes},
booktitle = {Sixth International Symposium on String Processing and Information
Retrieval and Fifth International Workshop on Groupware, {SPIRE/CRIWG}
1999, Cancun, Mexico, September 21-24, 1999},
pages = {115--119},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SPIRE.1999.796585},
doi = {10.1109/SPIRE.1999.796585},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/LaberMP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/MilidiuPL99,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
editor = {Ricardo A. Baeza{-}Yates and
Edgar Ch{\'{a}}vez and
Jes{\'{u}}s Favela},
title = {A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy
Prefix Codes},
booktitle = {Sixth International Symposium on String Processing and Information
Retrieval and Fifth International Workshop on Groupware, {SPIRE/CRIWG}
1999, Cancun, Mexico, September 21-24, 1999},
pages = {128--134},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SPIRE.1999.796587},
doi = {10.1109/SPIRE.1999.796587},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/MilidiuPL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/MiliduPL98,
author = {Ruy Luiz Milidi{\'{u}} and
Artur Alves Pessoa and
Eduardo Sany Laber},
title = {In-Place Length-Restricted Prefix Coding},
booktitle = {String Processing and Information Retrieval: {A} South American Symposium,
{SPIRE} 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998},
pages = {50--59},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SPIRE.1998.712982},
doi = {10.1109/SPIRE.1998.712982},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/MiliduPL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-25 02:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
