Complexity of Limit-Cycle Problems in Boolean Networks

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SOFSEM (47. : 2021 : Online) SOFSEM 2021: theory and practice of computer science
1. Verfasser: Bridoux, Florian (VerfasserIn)
Weitere Verfasser: Gaze-Maillot, Caroline (VerfasserIn), Perrot, Kévin (VerfasserIn), Sené, Sylvain (VerfasserIn)
Pages:2021
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2021
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Towards Knowledge Exchange: State-of-the-Art and Open Problems 2021 Bashardoost, Bahar Ghadiri
Towards Minimally Conscious Cyber-Physical Systems: A Manifesto 2021 Wiedermann, Jiří
Blocksequences of k-local Words 2021 Fleischmann, Pamela
The Multiple Traveling Salesman Problem on Spiders 2021 Pérez-Escalona, Pedro
An Infrastructure for Platform-Independent Experimentation of Software Changes 2021 Auer, Florian
Role-Based Access Control on Graph Databases 2021 Chabin, Jacques
Invited Talk: Resilient Distributed Algorithms 2021 Parter, Merav
Bike Assisted Evacuation on a Line 2021 Jawhar, Khaled
Concatenation Operations and Restricted Variants of Two-Dimensional Automata 2021 Smith, Taylor J.
Distance Hedonic Games 2021 Flammini, Michele
Iterated Uniform Finite-State Transducers on Unary Languages 2021 Kutrib, Martin
Hierarchical b-Matching 2021 Emek, Yuval
New Bounds on the Half-Duplex Communication Complexity 2021 Dementiev, Yuriy
On the Redundancy of D-Ary Fano Codes 2021 Cicalese, Ferdinando
Parameterized Complexity of d-Hitting Set with Quotas 2021 Gupta, Sushmita
On the Terminal Connection Problem 2021 Melo, Alexsander A. de
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs 2021 Berndt, Sebastian
A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78 2021 Jordon, Liam
Drawing Two Posets 2021 Brückner, Guido
Using Process Models to Understand Security Standards 2021 Moyón, Fabiola
Alle Artikel auflisten