·         Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni. Linear time analysis of properties of conflict-free and general Petri nets. Theoretical Computer Science 412 (4-5), 2011, pages 320-338, DOI: 10.1016/j.tcs.2010.09.030. Download PDF.

·         Esteban Feuerstein, Veronica Gil-Costa, Michel Mizrahi, Mauricio Marin. Performance Evaluation of Improved Web Search Algorithms. Aceptado para su presentación en 9th International Meeting on High Performance Computing for Computational Science VECPAR 2010. Download PDF.

·         Ricardo Baeza-Yates, Esteban Feuerstein, Verónica Gil-Costa, Mauricio Marin, Michel Mizrahi. Two-dimensional distributed inverted files. En Proc. 16th String Processing and Information Retrieval Symposium SPIRE 2009, LNCS 5721. Download PDF.

·         E. Feuerstein, P. Heiber, M. López-Rosenfeld, M. Mydlarz. Optimal Auctions Capturing Constraints in Sponsored Search. En Proc. 5th International Conference on Algorithmic Aspects in Information and Management, AAIM 2009, LNCS 5564. Download PDF.

·         M. Aprea, E. Feuerstein, G. Sadovoy, A. Strejilevich de Loma. Discrete Online TSP. En Proc. 5th International Conference on Algorithmic Aspects in Information and Management, AAIM 2009, LNCS 5564. Download PDF.

·         E. Feuerstein, P. Heiber, M. Mydlarz. Truthful stochastic and deterministic auctions for sponsored search. En  Proc. 6th Latin American Web Congress LA-WEB 2008. Download PDF.

·         E. Feuerstein, P. Heiber, J. Martínez-Viademonte, R. Baeza-Yates. New Stochastic Algorithms for Placing Ads in Sponsored Search. En  Proc. 5th Latin American Web Congress LA-WEB 2007. Download PDF.

·         E. Feuerstein, S. S. Seiden, A. Strejilevich de Loma. On Multi-threaded Metrical Task Systems. Journal of Discrete Algorithms 4, pp.401-413 (2006). Download PDF.

·         E. Feuerstein,, M. Mydlarz, L. Stougie. On-line Multi-threaded Scheduling. Journal of Scheduling 6:167-181, 2003.

·         E. Feuerstein, A. Strejilevich de Loma. On Line Multi-threaded Paging. Algorithmica (2002) 32: 36-60. Una versión preliminar apareció en Proceedings of the Seventh Annual International Symposium on Algorithms and Computation (ISAAC'96), Osaka, Japón, Diciembre 1996, LNCS 1178, Springer-Verlag. Download PDF.

·         E. Feuerstein, L. Stougie. On-line single-server dial a ride problems. Theoretical Computer Science 268 (1): 91-105 (2001). Download PDF.

·         G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie y M. Talamo. Algorithms for the On-line Traveling Salesman.  Algorithmica 29 (4): 560-581 (2001). Este artículo presenta resultados publicados en forma preliminar en sendos congresos internacionales con referato: Competitive Algorithms for the Traveling Salesman, en Proceedings of Workshop on Algorithms and Data Structures (WADS'95), LNCS 955, Springer-Verlag y Serving Request with On-line Routing, en Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory (SWAT'94), Aarhus, Dinamarca, Julio 1994, LNCS 824, Springer-Verlag. Download PDF.

·         Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi y A. Rosen.  On Capital Investment. Algorithmica 25 (1), pp. 22-36 (1999). Una versión preliminar apareció en Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96), LNCS, Springer-Verlag. Download PDF.

·         E. Feuerstein, S. Leonardi, A. Marchetti-Spaccamela y N. Santoro. Efficient Token-Based Control in Rings. En Information Processing Letters 66, pp. 75-80, (1998). Una versión preliminar apareció en Proceedings of the Fifteenth ACM Symposium on Principles of Distributed Computing (PODC'96).

·         E. Feuerstein y A. Marchetti-Spaccamela. Memory Paging for Connectivity and Path Problems in Graphs. En Journal on Graph Algorithms and Applications 2 (6), pp. 1-22 (1998). http://www.cs.brown.edu/publications/jgaa/. Una versión preliminar apareció en Proceedings of the Fourth Annual International Symposium on Algorithms and Computation (ISAAC'93), Hong Kong, Diciembre 1993, LNCS 762, Springer-Verlag. Download PDF.

·         E. Feuerstein. Uniform Service Systems with $k$-servers. En Proceedings of the Third Latin American Symposium on Theoretical Informatics (LATIN'98), LNCS 1380, Springer Verlag. Download PDF.

·         E. Feuerstein. Paging more than one page. En Theoretical Computer Science 181, pp. 75--90 (1997). Una versión preliminar de este trabajo aparece en Proceedings of the Second Latin American Theoretical Informatics Symposium (LATIN 95), Chile, LNCS 911, Springer-Verlag.

·         E. Feuerstein y A. Marchetti-Spaccamela. Dynamic Algorithms for Shortest Paths in Planar Graphs. Theoretical Computer Science 116:359-371 (1993). Una versión preliminar de este trabajo apareció en Proceedings of the 17th International Workshop on Graph-Theoretic Concepts in Computer Science, Richterheim Fischbachau, Alemania, junio de 1991, LNCS 578, Springer-Verlag.

·         E. Feuerstein. A Competitive Algorithm for the Paging Problem with sizes. En Proceedings de la XIX Conferencia Latinoamericana de Informática, Buenos Aires, Argentina, Agosto 1993.

·         P. Alimonti y E. Feuerstein. Petri Nets, Hypergraphs and Conflicts. En Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 657, Springer-Verlag.

·         P. Alimonti, E. Feuerstein y U. Nanni. Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. En Proceedings of the First Latin American Theoretical Informatics Symposium (LATIN 92), San Pablo, Brasil, LNCS 583, Springer-Verlag.

·         S. Bandinelli y E. Feuerstein. On Formally Refining Timed Petri Nets. En Anales de la Conferencia Latinoamericana de Informática, Caracas, Venezuela, julio de 1991.