Narrow your search

Library

KU Leuven (3)

UAntwerpen (2)

UCLouvain (2)

UGent (2)

UHasselt (2)

ULiège (2)

KBR (1)

ULB (1)

UNamur (1)

VUB (1)


Resource type

book (3)


Language

English (3)


Year
From To Submit

1985 (3)

Listing 1 - 3 of 3
Sort by
Algorithmic graph theory
Author:
ISBN: 0521288819 9780521288811 0521246598 9780521246590 Year: 1985 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Discrete mathematics --- Nonnumerical algorithms and problems: complexity of proof procedures computations on discrete structures geometrical problems and computations pattern matching --See also {?681.3*E2-5} {681.3*G2} {?681.3*H2-3} --- Graph theory: graph algorithms network problems path and tree problems trees--See also {681.3*F22} --- 681.3*G22 Graph theory: graph algorithms network problems path and tree problems trees--See also {681.3*F22} --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures computations on discrete structures geometrical problems and computations pattern matching --See also {?681.3*E2-5} {681.3*G2} {?681.3*H2-3} --- Graph theory --- #TELE:SISTA --- 681.3*F22 --- 681.3*G22 --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Data processing --- Extremal problems --- Computer science --- Graph theory. --- Data processing. --- Graph theory - Data processing --- Acqui 2006

Petri nets : an introduction.
Author:
ISBN: 3540137238 0387137238 3642699707 3642699685 9783540137238 9780387137230 Year: 1985 Volume: v. 4 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Computer science --- Petri nets --- 681.3*F0 --- 681.3*F11 --- 681.3*F12 --- 681.3*F22 --- 681.3*F32 --- Graph theory --- Nets (Mathematics) --- Computerwetenschap--?*F0 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} --- Petri nets. --- 681.3*F32 Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 681.3*F12 Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Réseaux de Pétri --- Réseaux de Pétri --- Theoretical Computer Sci --- synchronization --- Petri Net --- Parallelism

Paragon : A language using type hierarchies for the specification, implementation and selection of abstract data types
Author:
ISBN: 3540152121 354039348X Year: 1985 Volume: vol 189 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Programming --- 681.3*D32 --- 681.3*D33 --- 681.3*E2 --- 681.3*I22 --- language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- Languages constructs: abstract data types; concurrent programming structures;control structures; coroutines (Programming languages) --- Data storage representations: composite structures; contiguous representations; hash-table representations; linked representations; primitive data items --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 681.3*E2 Data storage representations: composite structures; contiguous representations; hash-table representations; linked representations; primitive data items --- 681.3*D33 Languages constructs: abstract data types; concurrent programming structures;control structures; coroutines (Programming languages) --- 681.3*D32 language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- Software engineering. --- Computer science. --- Data structures (Computer scienc. --- Software Engineering. --- Programming Languages, Compilers, Interpreters. --- Data Structures. --- Informatics --- Science --- Computer software engineering --- Engineering --- Paragon (computer program language)

Listing 1 - 3 of 3
Sort by