5.8k citations
- University of CoimbraPT27 papers
- Universidade do PortoPT21 papers
- INESC TECPT13 papers
- Instituto de Engenharia de Sistemas e Computadores Investigação e DesenvolvimentoPT11 papers
- University of LisbonPT10 papers
- University of MinhoPT10 papers
- Instituto Superior TécnicoPT6 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Instituto de TelecomunicaçõesPT4 papers
- Universidade Nova de LisboaPT4 papers
- Instituto Politécnico de LisboaPT3 papers
- Instituto Politécnico de TomarPT3 papers
4 papers · 1 filter
Fast Computation of the Discrete Fourier Transform Square Index Coefficients
Saulo Queiroz, João P. Vilela, Edmundo Monteiro
The -point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computationa…
The Hypervolume Indicator: Problems and Algorithms
Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete
The hypervolume indicator is one of the most used set-quality indicators for the assessment of stochastic multiobjective optimizers, as well as for selection in evolutionary multio…
Linking and Cutting Spanning Trees
Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P Francisco
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We de…
A Study on Splay Trees
Luís M. S. Russo
We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to…