UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

The Maximum Binary Tree Problem

Algorithmica, 2021-08, Vol.83 (8), p.2427-2468

2021

Volltextzugriff (PDF)

Game-Theoretic Models of Moral and Other-Regarding Agents (extended abstract)

Electronic proceedings in theoretical computer science, 2021, Vol.335, p.213-227

Istrate, Gabriel

2021

Volltextzugriff (PDF)

q-Overlaps in the Random Exact Cover Problem

Electronic proceedings in theoretical computer science, 2023, Vol.389, p.26-40

2023

Volltextzugriff (PDF)

Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs

Theoretical computer science, 2015-05, Vol.580, p.83-93

Istrate, Gabriel

2015

Volltextzugriff (PDF)

A parametric worst-case approach to fairness in cooperative games with transferable utility

Theoretical computer science, 2023-01, Vol.940, p.189-205

2023

Volltextzugriff (PDF)

Stochastic Stability in Schelling’s Segregation Model with Markovian Asynchronous Update

Cellular Automata, p.416-427

Volltextzugriff (PDF)

Identifying Almost Sorted Permutations from TCP Buffer Dynamics

Scientific Annals of Computer Science, 2015-01, Vol.25 (1), p.133-154

Istrate, Gabriel

2015

Volltextzugriff (PDF)

Learning Cover Context-Free Grammars from Structural Data

Theoretical Aspects of Computing – ICTAC 2014, p.241-258

Volltextzugriff (PDF)

On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)

Fundamenta informaticae, 2009, Vol.91 (2), p.341-356

Istrate, Gabriel

2009

Volltextzugriff (PDF)

Gambler’s ruin problem on Erdős–Rényi graphs

Physica A, 2017-02, Vol.468, p.147-157

2017

Volltextzugriff (PDF)

On the heapability of finite partial orders

Discrete mathematics and theoretical computer science, 2020-06, Vol.22 no. 1 (Combinatorics)

2020

Volltextzugriff (PDF)

Geometric properties of satisfying assignments of random ε-1-in-k SAT

International journal of computer mathematics, 2009-12, Vol.86 (12), p.2029-2039

Istrate, Gabriel

2009

Volltextzugriff (PDF)

Geometric properties of satisfying assignments of random [epsilon]-1-in-k SAT

International journal of computer mathematics, 2009-12, Vol.86 (12), p.2029

Istrate, Gabriel

2009

Volltextzugriff (PDF)

Short proofs of the Kneser–Lovász coloring principle

Information and computation, 2018-08, Vol.261, p.296-310

2018

Volltextzugriff (PDF)

Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem

Information processing letters, 2014-07, Vol.114 (7), p.360-364

2014

Volltextzugriff (PDF)

On the Heapability of Finite Partial Orders

Discrete mathematics and theoretical computer science, 2020-01, Vol.22 (1), p.1-23

2020

Volltextzugriff (PDF)

Models We Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation

Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, 2021, p.6-11

Istrate, Gabriel

2021

Volltextzugriff (PDF)

Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems

Descriptional Complexity of Formal Systems, 2016, Vol.9777, p.18-28

2016

Volltextzugriff (PDF)

Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process

Combinatorial Pattern Matching, 2015, Vol.9133, p.261-271

2015

Volltextzugriff (PDF)

Counting preimages of TCP reordering patterns

Discrete Applied Mathematics, 2008-10, Vol.156 (17), p.3187-3193

2008

Volltextzugriff (PDF)

Threshold properties of random boolean constraint satisfaction problems

Discrete Applied Mathematics, 2005-12, Vol.153 (1), p.141-152

Istrate, Gabriel

2005

Volltextzugriff (PDF)

The Minimum Entropy Submodular Set Cover Problem

Language and Automata Theory and Applications, p.295-306

Volltextzugriff (PDF)

Learning Cover Context-Free Grammars from Structural Data

Scientific Annals of Computer Science, 2014-01, Vol.24 (2), p.253-286

2014

Volltextzugriff (PDF)

The Language (and Series) of Hammersley-Type Processes

Machines, Computations, and Universality, 2018, Vol.10881, p.69-87

2018

Volltextzugriff (PDF)

Adversarial scheduling in discrete models of social dynamics

Mathematical structures in computer science, 2012-10, Vol.22 (5), p.788-815

2012

Volltextzugriff (PDF)

1 – 25 von 113

Menü

Weitere Dienste

Einstellungen

The Maximum Binary Tree Problem

Game-Theoretic Models of Moral and Other-Regarding Agents (extended abstract)

q-Overlaps in the Random Exact Cover Problem

Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs

A parametric worst-case approach to fairness in cooperative games with transferable utility

Stochastic Stability in Schelling’s Segregation Model with Markovian Asynchronous Update

Identifying Almost Sorted Permutations from TCP Buffer Dynamics

Learning Cover Context-Free Grammars from Structural Data

On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)

Gambler’s ruin problem on Erdős–Rényi graphs

On the heapability of finite partial orders

Geometric properties of satisfying assignments of random ε-1-in-k SAT

Geometric properties of satisfying assignments of random [epsilon]-1-in-k SAT

Short proofs of the Kneser–Lovász coloring principle

Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem

On the Heapability of Finite Partial Orders

Models We Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation

Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems

Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process

Counting preimages of TCP reordering patterns

Threshold properties of random boolean constraint satisfaction problems

The Minimum Entropy Submodular Set Cover Problem

Learning Cover Context-Free Grammars from Structural Data

The Language (and Series) of Hammersley-Type Processes

Adversarial scheduling in discrete models of social dynamics

Suchergebnisse filtern