| Año |
Marcos Kiwi
|
| 2010 | Satisfying states of triangulations of a convex n-gon
Jimenez A; Kiwi M; Loebl M; Electronic Journal of Cominatorics 17(39), Articule Nº R39. (2010) |
| 2009 | Adversarial queuing theory with setups
Kiwi M; Soto M; Thraves C; Theoretical Computer Sciences 410(8-10), pp. 670-687. (2009) |
| 2009 | On a Speculated Relation Between Chvatal-Sankoff Constants of Several Sequences
Kiwi M; Soto J; Combinatorics Probability & Computing 18(4), pp. 517-532. (2009) |
| 2008 | On-line Approximate String Matching with Bounded Errors
Kiwi M; Navarro G; Telha C; Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'08. Lecture Notes in Computer Science Volume 5029, pp. 130-142, Springer-Verlag. (2008) |
| 2008 | Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
Kiwi M; Loebl M; Electronic Journal of Combinatorics 15(1). (2008) |
| 2006 | A Concentration Bound for the Longest Increasing Subsequence of a Randomly Chosen Involutions
Kiwi M; Discrete Applied Mathematics. Vol. 154(13). (2006) |
| 2005 | Expected length of the longest common subsequence for large alphabets
Kiwi M; Loebl M; Matousek J; Adv. Math. Vol. 197 (2), pp. 480-498. (2005) |
| 2004 | Electronic Jury Voting Protocols
Kiwi M; Hevia A; Theor. Comput. Sci. Vol. 312(1). pp. 73-94. (2004) |
| 2004 | The Chilean highway problem
Kiwi M; Russell A; Theor. Comput. Sci. Vol. 326(1-3). pp. 329-342. (2004) |
| 2003 | Algebraic testing and weight distributions of codes
Kiwi M; Theoret. Comput. Sci. 299, no. 1-3, pp. 81-106. (2003) |
| 2003 | Approximate testing with error relative to input size
Kiwi M; Magniez F; M. Santha. J. Comput. Syst. Sci. Vol. 66(2). pp. 371-392. (2003) |
| 2002 | Largest planar matching in random bipartite graphs
Kiwi M; Loebl M; Random Structures Algorithms 21, no. 2, pp. 162-181. (2002) |
| 2002 | Exact and approximate testing/correcting of algebraic functions: a survey
Kiwi M; Magniez F; Santha M; Theoretical aspects of computer science (Tehran, 2000), 30-83, Lecture Notes in Comput. Sci., 2292, Springer, Berlin, 2002. |
| 2001 | Min-max-boundary domain decomposition. Computing and combinatorics (Taipei, 1998)
Kiwi M; Spielman DA; Teng, SH; Theoret. Comput. Sci. 261, no. 2, pp. 253-266. (2001) |
| 2000 | Threshold data structures and coding theory
Bach E; Kiwi M; Theoret. Comput. Sci. 235, no. 1, 3-23. (2000) |
| 2000 | Alternation in interaction
Kiwi M; Lund C; Spielman D; Russell A; Sundaram R; Comput. Complexity 9, no. 3-4, pp. 202-246. (2000) |
| 1999 | Approximate testing with relative error
Kiwi M; Magniez F; Santha M; Annual ACM Symposium on Theory of Computing (Atlanta, GA, 1999), pp. 51-60, ACM, New York. (1999) |
| 1998 | Strength of two data encryption standard implementations under timing attacks. LATIN 98: theoretical informatics (Campinas, 1998), 192 - 205
Hevia A; Kiwi M; Lecture Notes in Comput. Sci., 1380, Springer, Berlin. (1998) |
| 1998 | Min-max-boundary domain decomposition. Computing and combinatorics (Taipei, 1998), 137 - 146
Kiwi M; Spielman DA; Teng SH; Lecture Notes in Comput. Sci., 1449, Springer, Berlin. (1998) |
| 1996 | Linearity testing in characteristic two. Codes and complexity
Kiwi M; Sudan M; IEEE Trans. Inform. Theory 42, no. 6, part 1, pp. 1781-1795. (1996) |
| 1995 | Linearity testing in characteristic two. 36th Annual Symposium on Foundations of Computer Science (Milwaukee, WI, 1995), 432 - 441
Bellare M; Coppersmith D; Håstad J; Kiwi M; Sudan M; IEEE Comput. Soc. Press, Los Alamitos, CA. (1995) |
| 1994 | No polynomial bound for the period of the parallel chip firing game on graphs
Kiwi M; Ndoundam R; Tchuente M; Goles E; Theoret. Comput. Sci. 136, no. 2, pp. 527-532. (1994) |
| 1993 | Sand-pile dynamics in a one-dimensional bounded lattice. Cellular automata and cooperative systems (Les Houches, 1992), 211 - 225
Goles E; Kiwi M; A. NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 396, Kluwer Acad. Publ., Dordrecht. (1993) |
| 1993 | Games on line graphs and sand piles
Goles E; Kiwi M; A. Theoret. Comput. Sci. 115, no. 2, pp. 321-349. (1993) |
| 1992 | Dynamics of sand-piles games on graphs
Goles E; Kiwi M; A. Lecture Notes in Comput. Sci., 583, pp. 219-230, Springer, Berlin. (1992) |
| 1992 | A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer
Goles E; Kiwi M; Parallel Comput. 18, no. 3, pp. 345-354. (1992) |
| 1991 | One-dimensional sand piles, cellular automata and related models
Goles E; Kiwi M; Nonlinear phenomena in fluids, solids and other complex systems (Santiago, 1990), 169-185, North-Holland Delta Ser., North-Holland, Amsterdam, 1991. |
