Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 46 results in range #1 to #46.

Topology Control and Routing in Ad Hoc Networks: Label: en
Tournament Methods for WLAN: Analysis and Efficiency: Label: en
Data Gathering in Wireless Networks: Label: en
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks: Label: en
Time-Efficient Broadcast in Radio Networks: Label: en
Mathematical Optimization Models for WLAN Planning: Label: en
Permutation Routing and (ℓ, k)-Routing on Plane Grids: Label: en
Game-Theoretic Approaches to Optimization Problems in Communication Networks: Label: en
Optimization of OSPF Routing in IP Networks: Label: en
Problems in Dynamic Bandwidth Allocation in Connection Oriented Networks: Label: en
Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach: Label: en
Routing and Label Space Reduction in Label Switching Networks: Label: en
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems: Label: en
Traffic Grooming: Combinatorial Results and Practical Resolutions: Label: en
Graphs and Algorithms in Communication Networks on Seven League Boots: Label: en
Extremal Combinatorics: Label: en
Temporal logic and state systems: Label: en
Parametrized complexity theory.: Label: en
Complexity theory and cryptology. An introduction to cryptocomplexity.: Label: en
Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant: Label: en
Dissemination of information in optical networks: From technology to algorithms. In cooperation with Ralf Klasing.: Label: en
Modelling distributed systems.: Label: en
Formal methods for software engineering. Languages, methods, application domains. With a foreword by Manfred Broy and a contribution on the origins and development of formal methods by John V. Tucker: Label: en
Design and analysis of randomized algorithms. Introduction to design paradigms.: Label: en
Grammatical picture generation. A tree-based approach. With CD-ROM.: Label: en
Software engineering 2. Specification of systems and languages. With contributions from Christian Krog Madsen.: Label: en
Software engineering 1. Abstraction and modelling.: Label: en
Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.: Label: en
DNA computing. New computing paradigms.: Label: en
Algorithmics for hard problems.: Label: en
A practical theory of reactive systems. Incremental modeling of dynamic behaviors.: Label: en
Abstract computing machines. A lambda calculus perspective.: Label: en
Universal artificial intelligence. Sequential decisions based on algorithmic probability.: Label: en
Models of computation: Label: en
Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography.: Label: en
Verification of reactive systems. Formal methods and algorithms.: Label: en
Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks: Label: en
Petri net synthesis: Label: en
Introduction to concurrency theory. Transition systems and CCS: Label: en
Elements of finite model theory.: Label: en
Finite model theory and its applications.: Label: en
Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.: Label: en
The parametric lambda calculus. A metamodel for computation.: Label: en
Exact exponential algorithms.: Label: en
Decision procedures. An algorithmic point of view: Label: en
The complexity theory companion: Label: en