International Symposium on Latin American Theoretical Informatics

LATIN

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

851

1992–2024

Best Theory of Computation conferences

Papers per year

199273 peak2024

Most published authors

LATIN papers

851 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2018	An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0.	Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam
2018	Competitive Algorithms for Demand Response Management in Smart Grid.	Vincent Chau, Shengzhong Feng, Kim Thang Nguyen
2018	Property Suffix Array with Applications.	Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
2018	Algorithms and Bounds for Very Strong Rainbow Coloring.	L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
2018	Agglomerative Clustering of Growing Squares.	Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek
2018	The Online Set Aggregation Problem.	Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, Jos Verschae
2018	Maximum Box Problem on Stochastic Points.	Luis Evaristo Caraballo, Pablo Prez-Lantero, Carlos Seara, Inmaculada Ventura
2018	Approximation Algorithms for Replenishment Problems with Fixed Turnover Times.	Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie
2018	A Tight Bound for Shortest Augmenting Paths on Trees.	Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
2018	Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set.	Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
2018	Random Walks with Multiple Step Lengths.	Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc P. Renault
2018	Compact Self-Stabilizing Leader Election for General Networks.	Llia Blin, Sbastien Tixeuil
2018	Partitioning Orthogonal Histograms into Rectangular Boxes.	Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte
2018	The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model.	Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2018	Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via Embeddings.	Yair Bartal, Lee-Ad Gottlieb
2018	Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees.	Bahareh Banyassady, Luis Barba, Wolfgang Mulzer
2018	A Polynomial Sized Kernel for Tracking Paths Problem.	Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2018	Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.	Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis
2018	On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.	Jlio Arajo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
2018	A Collection of Lower Bounds for Online Matching on the Line.	Antonios Antoniadis, Carsten Fischer, Andreas Tnnis
2018	Walking Through Waypoints.	Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
2018	Finding Tight Hamilton Cycles in Random Hypergraphs Faster.	Peter Allen, Christoph Koch, Olaf Parczyk, Yury Person
2018	Approximate Correlation Clustering Using Same-Cluster Queries.	Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal
2018	Scheduling Parallelizable Jobs Online to Maximize Throughput.	Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley
2018	The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.	Alexandre Santiago de Abreu, Lus Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal

176–200 of 851← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.