Esteban Feuerstein
Esteban Feuerstein
Profesor Asociado - Departamento de Computación - Universidad de Buenos Aires
Email confirmado em
Citado por
Citado por
Algorithms for the On-Line Travelling Salesman 1
G Ausiello, E Feuerstein, S Leonardi, L Stougie, M Talamo
Algorithmica 29, 560-581, 2001
On-line single-server dial-a-ride problems
E Feuerstein, L Stougie
Theoretical Computer Science 268 (1), 91-105, 2001
On capital investment
Y Azar, Y Bartal, E Feuerstein, A Fiat, S Leonardi, A Rosén
Algorithmica 25, 22-36, 1999
Dynamic algorithms for shortest paths in planar graphs
E Feuerstein, A Marchetti-Spaccamela
Theoretical Computer Science 116 (2), 359-371, 1993
Competitive algorithms for the on-line traveling salesman
G Ausiello, E Feuerstein, S Leonardi, L Stougie, M Talamo
Algorithms and Data Structures: 4th International Workshop, WADS'95 Kingston …, 1995
Composite retrieval of diverse and complementary bundles
S Amer-Yahia, F Bonchi, C Castillo, E Feuerstein, I Mendez-Diaz, ...
IEEE Transactions on Knowledge and Data Engineering 26 (11), 2662-2675, 2014
Serving requests with on-line routing
G Ausiello, E Feuerstein, S Leonardi, L Stougie, M Talamo
Algorithm Theory—SWAT'94: 4th Scandinavian Workshop on Algorithm Theory …, 1994
On-Line Multi-Threaded Paging
E Feuerstein, A Strejilevich de Loma
Algorithmica 32 (1), 36-60, 2002
Performance improvements for search systems using an integrated cache of lists+ intersections
G Tolosa, E Feuerstein, L Becchetti, A Marchetti-Spaccamela
Information Retrieval Journal 20, 172-198, 2017
Linear time algorithms for liveness and boundedness in conflict-free Petri nets
P Alimonti, E Feuerstein, U Nanni
Latin American Symposium on Theoretical Informatics, 1-14, 1992
Memory paging for connectivity and path problems in graphs
E Feuerstein, A Marchetti-Spaccamela
Algorithms and Computation: 4th International Symposium, ISAAC'93 Hong Kong …, 1993
Linear time analysis of properties of conflict-free and general Petri nets
P Alimonti, E Feuerstein, L Laura, U Nanni
Theoretical Computer Science 412 (4-5), 320-338, 2011
Minimizing worst-case and average-case makespan over scenarios
E Feuerstein, A Marchetti-Spaccamela, F Schalekamp, R Sitters, ...
Journal of Scheduling 20, 545-555, 2017
Measuring controversy in social networks through nlp
JMO de Zarate, M Di Giovanni, EZ Feuerstein, M Brambilla
String Processing and Information Retrieval: 27th International Symposium …, 2020
New stochastic algorithms for scheduling ads in sponsored search
E Feuerstein, PA Heiber, J Martínez-Viademonte, R Baeza-Yates
2007 Latin American Web Conference (LA-WEB 2007), 22-31, 2007
Complexity and algorithms for composite retrieval
S Amer-Yahia, F Bonchi, C Castillo, E Feuerstein, I Méndez-Díaz, ...
Proceedings of the 22nd International Conference on World Wide Web, 79-80, 2013
Two-dimensional distributed inverted files
E Feuerstein, M Marin, M Mizrahi, V Gil-Costa, R Baeza-Yates
International Symposium on String Processing and Information Retrieval, 206-213, 2009
On-line paging of structured data and multi-threaded paging
E Feuerstein
PhD thesis, University of Rome, 1995
Vocabulary-Based Method for Quantifying Controversy in Social Media.
JMO De Zarate, E Feuerstein
ICCS, 161-176, 2020
Cost-aware intersection caching and processing strategies for in-memory inverted indexes
E Feuerstein, G Tolosa
In Proc. of 11th Workshop on Large-scale and Distributed Systems for …, 2014
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20