Home
 Sobre el DIM
 Carrera
 Docencia
 Doctorado
 Investigación
 Académicos 
 Funcionarios 
 Profesores Visitantes 
 Alumnos 
 Biblioteca
 Publicaciones Científicas 
 Publicaciones Docentes 
 Seminario
 Novedades 
 Eventos 
 Congresos DIM
 Link de Interés 
 Contáctenos 
 Intranet
 
 
 
PS PDF Imprimir E-mail

Artículos

por Kiwi K., Marcos

2009

29.- Kiwi, Marcos; Soto, J. On a speculated relation between Chvátal-Sankoff constants of several sequences. Combin. Probab. Comput. 18 (2009), no. 4, 517--532.

28.- Kiwi, Marcos; Soto, M.; Thraves, C. Adversarial queuing theory with setups. Theoret. Comput. Sci. 410 (2009), no. 8-10, 670--687.

2009

27.- Kiwi, Marcos; Loebl, Martin. Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs. Electron. J. Combin. 15 (2008), no. 1, Research Paper 135, 20 pp.

26.- Correa, José R.; Kiwi, Marcos. Foreword [Selected papers from the Seventh Latin American Theoretical Informatics Conference (LATIN)]. Held in Valdivia, March 2004, 2006. Algorithmica 50 (2008), no. 4, 415--417.

2006

25.- LATIN 2006: Theoretical informatics. Proceedings of the 7th Latin American Symposium held in Valdivia, March 20--24, 2006. Edited by José R. Correa, Alejandro Hevia and Kiwi, Marcos. Lecture Notes in Computer Science, 3887. Springer-Verlag, Berlin, 2006.

24.- Kiwi, Marcos. A concentration bound for the longest increasing subsequence of a randomly chosen involution. Discrete Appl. Math. 154 (2006), no. 13, 1816--1823.

2005

23.- Kiwi, Marcos; Loebl, Martin; Matou\v sek, Jiv rí.  Expected length of the longest common subsequence for large alphabets. Adv. Math. 197 (2005), no. 2, 480--498.

2004

22.- Kiwi, Marcos; Loebl, Martin; Matou\v sek, Ji\v rí. Expected length of the longest common subsequence for large alphabets. LATIN 2004: Theoretical informatics, 302--311

21.- Kiwi, Marcos; Russell, Alexander. The Chilean highway problem. Theoret. Comput. Sci. 326 (2004), no. 1-3, 329--342.

20.- Hevia, Alejandro; Kiwi, Marcos. Electronic jury voting protocols. Theoret. Comput. Sci. 321 (2004), no. 1, 73--94.

2003

19.- Kiwi, Marcos; Magniez, Frédéric; Santha, Miklos. Approximate testing with error relative to input size. J. Comput. System Sci. 66 (2003), no. 2, 371--392.

18.- Kiwi, Marcos. Algebraic testing and weight distributions of codes. Theoret. Comput. Sci. 299 (2003), no. 1-3, 81--106.

2002

17.- Hevia, Alejandro; Kiwi, Marcos. Electronic jury voting protocols. LATIN 2002: Theoretical informatics (Cancun), 415--429, Lecture Notes in Comput. Sci., 2286, Springer, Berlin, 2002.

16.- Kiwi, Marcos; Loebl, Martin Largest planar matching in random bipartite graphs. Random Structures Algorithms 21 (2002), no. 2, 162--181.

15.- Kiwi, Marcos; Magniez, Frédéric; Santha, Miklos Exact and approximate testing/correcting of algebraic functions: a survey. Theoretical aspects of computer science (Tehran, 2000), 30--83, Lecture Notes in Comput. Sci., 2292, Springer, Berlin, 2002.

2001

14.- Kiwi, Marcos; Spielman, Daniel A.; Teng, Shang-Hua. Min-max-boundary domain decomposition. Computing and combinatorics (Taipei, 1998). Theoret. Comput. Sci. 261 (2001), no. 2, 253 - 266. 

2000

13.- Kiwi, Marcos; Lund, Carsten; Spielman, Daniel; Russell, Alexander; Sundaram, Ravi Alternation in interaction. Comput. Complexity 9 (2000), no. 3-4, 202--246.

12.- Bach, Eric; Kiwi, Marcos. Threshold data structures and coding theory. Theoret. Comput. Sci. 235 (2000), no. 1, 3 - 23. 

1999

11.- Kiwi, Marcos; Magniez, Frédéric; Santha, Miklos. Approximate testing with relative error. Annual ACM Symposium on Theory of Computing (Atlanta, GA, 1999), 51 - 60,ACM, New York, 1999.

1998

10.- Hevia, Alejandro; Kiwi, Marcos. Strength of two data encryption standard implementations under timing attacks. LATIN’98: theoretical informatics (Campinas, 1998), 192 - 205, Lecture Notes in Comput. Sci., 1380, Springer, Berlin, 1998.

9.- Kiwi, Marcos; Spielman, Daniel A.; Teng, Shang-Hua. Min-max-boundary domain decomposition. Computing and combinatorics (Taipei, 1998), 137 - 146, Lecture Notes in Comput. Sci., 1449, Springer, Berlin, 1998.

1996

8.- Bellare, Mihir; Coppersmith, Don; Kiwi, Marcos; Sudan, Madhu. Linearity testing in characteristic two. Codes and complexity. IEEE Trans. Inform. Theory 42 (1996), no. 6, part 1, 1781 - 1795.

1995

7.- Bellare, M.; Coppersmith, D.; Håstad, J.; Kiwi, Marcos; Sudan, M. Linearity testing in characteristic two. 36th Annual Symposium on Foundations of Computer Science (Milwaukee, WI, 1995), 432 - 441, IEEE Comput. Soc. Press, Los Alamitos, CA,1995.

1994

6.- Kiwi, Marcos; Ndoundam, R.; Tchuente, M.; Goles, E. No polynomial bound for the period of the parallel chip firing game on graphs. Theoret. Comput. Sci. 136 (1994), no. 2, 527 - 532. 

1993

5.- Goles, Eric; Kiwi, Marcos A. Sand-pile dynamics in a one-dimensional bounded lattice. Cellular automata and cooperative systems (Les Houches, 1992), 211 - 225, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 396, Kluwer Acad. Publ., Dordrecht, 1993. 

4.-   Eric, Goles  ;  Kiwi, Marcos A. Games on line graphs and sand piles. Theoret. Comput. Sci. 115 (1993), no. 2, 321 - 349. 

1992

3.- Goles, Eric; Kiwi, Marcos A. Dynamics of sand-piles games on graphs. Lecture Notes in Comput. Sci., 583, 219 - 230, Springer, Berlin, 1992. 

2.- Goles, Eric; Kiwi, Marcos. A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer. Parallel Comput. 18 (1992), no. 3, 345 - 354.

1991

1.- Goles, Eric; Kiwi, Marcos. One-dimensional sand piles, cellular automata and related models. Nonlinear phenomena in fluids, solids and other complex systems (Santiago, 1990), 169 - 185, North-Holland Delta Ser., North-Holland, Amsterdam, 1991.

 



[Volver a la Lista]
nº de visitas:   650228  

La página se generó en 0.015 Segundos
Optimized for Explorer 5.x, Mozilla1.x or Netscape 7
Copyright 2003,Sidwod Inc.  All rights reserved.