LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642121999, 9783642122002

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lightweight Data Indexing and Compression in External Memory

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_60 ◽

2010 ◽

pp. 697-710 ◽

Cited By ~ 12

Author(s):

Paolo Ferragina ◽

Travis Gagie ◽

Giovanni Manzini

Keyword(s):

External Memory ◽

Data Indexing

Download Full-text

Ambiguity and Deficiency in Costas Arrays and APN Permutations

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_35 ◽

2010 ◽

pp. 397-406 ◽

Cited By ~ 3

Author(s):

Daniel Panario ◽

Brett Stevens ◽

Qiang Wang

Download Full-text

Average Parameterization and Partial Kernelization for Computing Medians

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_7 ◽

2010 ◽

pp. 60-71

Author(s):

Nadja Betzler ◽

Jiong Guo ◽

Christian Komusiewicz ◽

Rolf Niedermeier

Download Full-text

Tilings Robust to Errors

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_42 ◽

2010 ◽

pp. 480-491

Author(s):

Alexis Ballier ◽

Bruno Durand ◽

Emmanuel Jeandel

Download Full-text

Finding the Best CAFE Is NP-Hard

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_32 ◽

2010 ◽

pp. 356-371 ◽

Cited By ~ 1

Author(s):

Elizabeth Maltais ◽

Lucia Moura

Keyword(s):

Np Hard

Download Full-text

Packet Routing on the Grid

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_12 ◽

2010 ◽

pp. 120-130 ◽

Cited By ~ 3

Author(s):

Britta Peis ◽

Martin Skutella ◽

Andreas Wiese

Keyword(s):

Packet Routing

Download Full-text

The I/O Complexity of Sparse Matrix Dense Matrix Multiplication

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_14 ◽

2010 ◽

pp. 143-156 ◽

Cited By ~ 5

Author(s):

Gero Greiner ◽

Riko Jacob

Keyword(s):

Sparse Matrix ◽

Matrix Multiplication ◽

Dense Matrix

Download Full-text

The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_3 ◽

2010 ◽

pp. 14-25 ◽

Cited By ~ 9

Author(s):

Jonathan Backer ◽

J. Mark Keil

Download Full-text

Counting Hexagonal Patches and Independent Sets in Circle Graphs

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_52 ◽

2010 ◽

pp. 603-614

Author(s):

Paul Bonsma ◽

Felix Breuer

Keyword(s):

Independent Sets ◽

Circle Graphs

Download Full-text

Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-12200-2_23 ◽

2010 ◽

pp. 243-254 ◽

Cited By ~ 1

Author(s):

Joachim von zur Gathen ◽

Alfredo Viola ◽

Konstantin Ziegler

Keyword(s):

Finite Fields ◽

Multivariate Polynomials ◽

Polynomials Over Finite Fields

Download Full-text

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Lightweight Data Indexing and Compression in External Memory

Ambiguity and Deficiency in Costas Arrays and APN Permutations

Average Parameterization and Partial Kernelization for Computing Medians

Tilings Robust to Errors

Finding the Best CAFE Is NP-Hard

Packet Routing on the Grid

The I/O Complexity of Sparse Matrix Dense Matrix Multiplication

The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions

Counting Hexagonal Patches and Independent Sets in Circle Graphs

Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields

LATIN 2010: Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications