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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540673064, 9783540464150

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Finding Skew Partitions Efficiently

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

10.1007/10719839_18 ◽

2000 ◽

pp. 163-172

Author(s):

Celina M. H. de Figueiredo ◽

Sulamita Klein ◽

Yoshiharu Kohayakawa ◽

Bruce A. Reed

Download Full-text

Almost k-Wise Independence and Hard Boolean Functions

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

10.1007/10719839_20 ◽

2000 ◽

pp. 197-206

Author(s):

Valentine Kabanets

Keyword(s):

Boolean Functions

Download Full-text

Algorithmic Aspects of Regularity

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

10.1007/10719839_1 ◽

2000 ◽

pp. 1-17 ◽

Cited By ~ 1

Author(s):

Y. Kohayakawa ◽

V. Rödl

Download Full-text

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography

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

10.1007/10719839_29 ◽

2000 ◽

pp. 280-291 ◽

Cited By ~ 2

Author(s):

Matthias Krause ◽

Hans Ulrich Simon

Keyword(s):

Secret Sharing ◽

Visual Cryptography ◽

Secret Sharing Schemes

Download Full-text

On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)

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

10.1007/10719839_19 ◽

2000 ◽

pp. 173-196 ◽

Cited By ~ 9

Author(s):

Allan Borodin ◽

Ran El-Yaniv ◽

Vincent Gogan

Keyword(s):

Portfolio Selection ◽

Theory And Practice

Download Full-text

Cube Packing

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

10.1007/10719839_6 ◽

2000 ◽

pp. 58-67 ◽

Cited By ~ 1

Author(s):

F. K. Miyazawa ◽

Y. Wakabayashi

Keyword(s):

Cube Packing

Download Full-text

Unambiguous Büchi Automata

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

10.1007/10719839_40 ◽

2000 ◽

pp. 407-416 ◽

Cited By ~ 3

Author(s):

Olivier Carton ◽

Max Michel

Keyword(s):

Büchi Automata ◽

Buchi Automata

Download Full-text

Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs

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

10.1007/10719839_3 ◽

2000 ◽

pp. 28-37 ◽

Cited By ~ 1

Author(s):

Vlady Ravelomanana ◽

Loÿs Thimonier

Keyword(s):

Labeled Graphs

Download Full-text

Quintic Reciprocity and Primality Test for Numbers of the Form $M~=~A5^{n} \pm ~\omega_{n}$

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

10.1007/10719839_28 ◽

2000 ◽

pp. 269-279

Author(s):

Pedro Berrizbeitia ◽

Mauricio Odreman Vera ◽

Juan Tena Ayuso

Keyword(s):

Primality Test

Download Full-text

Edge Colouring Reduced Indifference Graphs

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

10.1007/10719839_16 ◽

2000 ◽

pp. 145-153

Author(s):

Celina M. H. de Figueiredo ◽

Célia Picinin de Mello ◽

Carmen Ortiz

Keyword(s):

Edge Colouring

Download Full-text

Lecture Notes in Computer Science - LATIN 2000: Theoretical InformaticsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Finding Skew Partitions Efficiently

Almost k-Wise Independence and Hard Boolean Functions

Algorithmic Aspects of Regularity

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography

On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)

Cube Packing

Unambiguous Büchi Automata

Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs

Quintic Reciprocity and Primality Test for Numbers of the Form $M~=~A5^{n} \pm ~\omega_{n}$

Edge Colouring Reduced Indifference Graphs

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