Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Pólya's cycle polynomial is demonstrated.

Computer algorithms.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

Engineering & Applied Sciences --- Computer Science --- Computer science --- Computer algorithms --- Statistical methods --- Informatics --- Computer science. --- Computer communication systems. --- Data structures (Computer science). --- Computers. --- Algorithms. --- Computer graphics. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Data Structures. --- Computation by Abstract Devices. --- Computer Graphics. --- Computer Communication Networks. --- Mathematics. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Computer mathematics --- Discrete mathematics --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Science --- Digital techniques --- Mathematics --- Foundations --- Distributed processing --- Computer software. --- Computational complexity. --- Data structures (Computer scienc. --- Data structures (Computer science) --- Complexity, Computational --- Software, Computer --- Computer science—Mathematics. --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Computer networks. --- Data Science. --- Theory of Computation. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Complex analysis --- Discrete mathematics --- Computer science --- Computer architecture. Operating systems --- Artificial intelligence. Robotics. Simulation. Graphics --- discrete wiskunde --- complexe analyse (wiskunde) --- grafische vormgeving --- informatica --- database management --- programmatielogica --- KI (kunstmatige intelligentie) --- computernetwerken

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations. LNCS 5126 contains 56 contributions of track B and track C selected from 208 submissions and 2 invited lectures. The papers for track B are organized in topical sections on bounds, distributed computation, real-time and probabilistic systems, logic and complexity, words and trees, nonstandard models of computation, reasoning about computation, and verification. The papers of track C cover topics in security and cryptography such as theory, secure computation, two-party protocols and zero-knowledge, encryption with special properties/quantum cryptography, various types of hashing, as well as public-key cryptography and authentication.

Discrete mathematics --- Computer science --- Programming --- Information systems --- Computer. Automation --- toegepaste informatica --- discrete wiskunde --- cryptologie --- informatica --- computerbesturingssystemen --- programmeren (informatica) --- database management --- programmatielogica --- numerieke analyse

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete mathematics --- Computer science --- Programming --- Information systems --- Computer. Automation --- toegepaste informatica --- discrete wiskunde --- cryptologie --- informatica --- computerbesturingssystemen --- programmeren (informatica) --- database management --- programmatielogica --- numerieke analyse