arXiv 2002-10-21 EN Tetris is Hard, Even to Approximate Demaine, Erik D. · Hohenberger, Susan · Liben-Nowell, David
arXiv 2002-09-17 EN A Novel Approach Applied to the Largest Clique Problem Gudkov, Vladimir · Nussinov, Shmuel · Nussinov, Zohar
arXiv 2002-09-04 EN Sampling from a couple of positively correlated binomial variables Catalani, Mario
arXiv 2002-09-04 EN Approaches to Network Classification Gudkov, Vladimir · Johnson, Joseph E. · Nussinov, Shmuel
arXiv 2002-09-04 EN Graph equivalence and characterization via a continuous evolution of a physical analog Gudkov, Vladimir · Nussinov, Shmuel
arXiv 2002-08-06 EN On the graph coloring check-digit scheme with applications to verifiable secret sharing Kulesza, Kamil · Kotulski, Zbigniew
arXiv 2002-07-23 EN Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs Benczur, Andras · Karger, David R.
arXiv 2002-07-08 EN Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications Goldwasser, Michael H. · Kao, Ming-Yang · Lu, Hsueh-I
arXiv 2002-07-04 EN Alternative solutions to diluted p-spin models and XORSAT problems Mezard, M. · Ricci-Tersenghi, F. · Zecchina, R.
arXiv 2002-07-03 EN Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications Grolmusz, Vince
arXiv 2002-06-15 EN Sierpinski Gaskets for Logic Functions Representation Popel, Denis V. · Dani, Anita
arXiv 2001-12-21 EN Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices Wocjan, Pawel · Janzing, Dominik · Beth, Thomas
arXiv 2001-12-11 EN Computing the average parallelism in trace monoids Krob, Daniel · Mairesse, Jean · Michos, Ioannis
