Using Complexity to Protect ElectionsFALISZEWSKI, Piotr; HEMASPAANDRA, Edith; HEMASPAANDRA, Lane A et al.Communications of the ACM. 2010, Vol 53, Num 11, issn 0001-0782, 74-82 [8 p.]Article

Parameterized complexity: The main ideas and some research frontiersFELLOWS, Michael R.Lecture notes in computer science. 2001, pp 291-307, issn 0302-9743, isbn 3-540-42985-9Conference Paper

A short note on some tractable cases of the satisfiability problemVAN MAAREN, H.Information and computation (Print). 2000, Vol 158, Num 2, pp 125-130, issn 0890-5401Article

Circuits on cylindersHANSEN, Kristoffer Arnsfelt; MILTERSEN, Peter Bro; VINAY, V et al.Lecture notes in computer science. 2003, pp 171-182, issn 0302-9743, isbn 3-540-40543-7, 12 p.Conference Paper

Finding extremal sets in less than quadratic timeYELLIN, D. M; JUTLA, C. S.Information processing letters. 1993, Vol 48, Num 1, pp 29-34, issn 0020-0190Article

The history of complexityFORTNOW, Lance.Proceedings - IEEE Conference on Computational Complexity. 2002, issn 1093-0159, isbn 0-7695-1468-5, p. 61Conference Paper

Space Hierarchy Theorem revisedGEFFERT, Viliam.Lecture notes in computer science. 2001, pp 387-397, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Anomaly Detection: A SurveyCHANDOLA, Varun; BANERJEE, Arindam; KUMAR, Vipin et al.ACM computing surveys. 2009, Vol 41, Num 3, issn 0360-0300, 15:1-15:58Article

Prefix-free languages and initial segments of computably enumerable degreesGUOHUA WU.Lecture notes in computer science. 2001, pp 576-585, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Exact solution of a minimal recurrenceCHANG, K.-N; TSAI, S.-C.Information processing letters. 2000, Vol 75, Num 1-2, pp 61-64, issn 0020-0190Article

On variations of the subset sum problemRAMIREZ ALFONSIN, J. L.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 1-7, issn 0166-218XArticle

Selected papers of the third ERCIM workshop on Formal Methods for Industrial Critical Systems (FMICS98)GROOTE, Jan Friso; LUTTIK, Bas; VAN WAMEL, Jos et al.Formal aspects of computing. 1998, Vol 10, Num 5-6, issn 0934-5043, 142 p.Conference Proceedings

The computational complexity of automated redistricting : Is automation the answer ?ALTMAN, M.Rutgers computer & technology law journal. 1997, Vol 23, Num 1, pp 81-142, issn 0735-8938Article

Randomization and approximation techniques in computer science (Bologna, July 11-12, 1997)Rolim, José.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63248-4, VIII, 225 p, isbn 3-540-63248-4Conference Proceedings

Multilist layering : complexity and applicationsDESSMARK, A; LINGAS, A; ANIL MAHESHWARI et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 337-350, issn 0304-3975Article

Some results on elusive graph propertiesTRIESCH, E.SIAM journal on computing (Print). 1994, Vol 23, Num 2, pp 247-254, issn 0097-5397Article

Computational limitations on training sigmoid neural networksHÖFFGEN, K.-U.Information processing letters. 1993, Vol 46, Num 6, pp 269-274, issn 0020-0190Article

Computational Complexity and Information Asymmetry in Financial ProductsARORA, Sanjeev; BARAK, Boaz; BRUNNERMEIER, Markus et al.Communications of the ACM. 2011, Vol 54, Num 5, pp 101-107, issn 0001-0782, 7 p.Article

Technical Perspective Constraint Satisfaction Problems and Computational ComplexityJERRUM, Mark.Communications of the ACM. 2010, Vol 53, Num 9, issn 0001-0782, p. 98Article

BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERSKAROLYI, Gyula.Report - Probability, networks and algorithms. 2008, Num 1, pp 1-13, issn 1386-3711, 13 p.Article

Computationally efficient image mosaicing using spanning tree representationsNIKOLAIDIS, Nikos; PITAS, Ioannis.Lecture notes in computer science. 2005, pp 716-724, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 9 p.Conference Paper

The computational complexity of one-dimensional sandpilesMILTERSEN, Peter Bro.Lecture notes in computer science. 2005, pp 342-348, issn 0302-9743, isbn 3-540-26179-6, 7 p.Conference Paper

Algebras of minimal rank over arbitrary fieldsBLÄSER, Markus.Lecture notes in computer science. 2003, pp 403-414, issn 0302-9743, isbn 3-540-00623-0, 12 p.Conference Paper

A time hierarchy for bounded one-way cellular automataKLEIN, Andreas; KUTRIB, Martin.Lecture notes in computer science. 2001, pp 439-450, issn 0302-9743, isbn 3-540-42496-2Conference Paper

The parameterized complexity of intersection and composition operations on sets of finite-state automataWAREHAM, H. Todd.Lecture notes in computer science. 2001, pp 302-310, issn 0302-9743, isbn 3-540-42491-1Conference Paper