Erscheinungsjahr
Format
Lizenz
Sprache
TIB-Lesesaalbestand
-
Advanced Flow-Based Multilevel Hypergraph Partitioning
Freier ZugriffDataCite | 2020|Schlagwörter: Mathematics of computing → Network flows, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph algorithms -
Convergence Properties of Newton’s Method for Globally Optimal Free Flight Trajectory Optimization (Short Paper)
Freier ZugriffDataCite | 2023|Schlagwörter: Mathematics of computing → Network optimization, Mathematics of computing → Continuous optimization, Mathematics of computing → Discrete optimization, Mathematics of computing → Ordinary differential equations, Mathematics of computing → Continuous functions, Mathematics of computing → Discretization, Mathematics of computing → Nonconvex optimization, Mathematics of computing → Graph algorithms -
LIPIcs, Volume 145, APPROX/RANDOM'19, Complete Volume
Freier ZugriffDataCite | 2019|Schlagwörter: Mathematics of computing, Mathematics of computing; Theory of computation -
LIPIcs, Volume 151, ITCS'20, Complete Volume
Freier ZugriffDataCite | 2020|Schlagwörter: Mathematics of computing, Mathematics of computing; Theory of computation -
Automatic Design of Boolean Networks for Cell Differentiation
Springer Verlag | 2017|Schlagwörter: Mathematics of Computing -
A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization
Freier ZugriffDataCite | 2022|Schlagwörter: Mathematics of computing → Continuous optimization, Mathematics of computing → Discrete optimization, Mathematics of computing → Continuous functions, Mathematics of computing → Discretization, Mathematics of computing → Nonconvex optimization, Mathematics of computing → Graph algorithms -
On How Turing and Singleton Arc Consistency Broke the Enigma Code
Freier ZugriffDataCite | 2021|Schlagwörter: Mathematics of computing → Combinatorial optimization, Mathematics of computing → Combinatoric problems -
Almost Optimal Testers for Concise Representations
Freier ZugriffDataCite | 2020|Schlagwörter: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms -
Reaching a Consensus on Random Networks: The Power of Few
Freier ZugriffDataCite | 2020|Schlagwörter: Mathematics of computing → Graph theory, Mathematics of computing → Probability and statistics, Mathematics of computing → Random graphs -
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections
Freier ZugriffDataCite | 2023|Schlagwörter: Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Enumeration, Mathematics of computing → Permutations and combinations -
Algorithms for Length Spectra of Combinatorial Tori
Freier ZugriffDataCite | 2023|Schlagwörter: Mathematics of computing → Enumeration, Mathematics of computing → Geometric topology, Mathematics of computing → Graphs and surfaces -
Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk)
Freier ZugriffDataCite | 2022|Schlagwörter: Mathematics of computing → Enumeration, Mathematics of computing → Random graphs, Mathematics of computing → Generating functions -
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items
Freier ZugriffDataCite | 2019|Schlagwörter: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms -
A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture
Freier ZugriffDataCite | 2023|Schlagwörter: Mathematics of computing → Matchings and factors, Mathematics of computing → Graph coloring, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph enumeration -
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives
Freier ZugriffDataCite | 2020|Schlagwörter: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms -
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
Freier ZugriffDataCite | 2019|Schlagwörter: Mathematics of computing → Approximation algorithms, Mathematics of computing → Spectra of graphs, Mathematics of computing → Graph algorithms -
The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem
Freier ZugriffDataCite | 2020|Schlagwörter: Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Enumeration, Mathematics of computing → Combinatoric problems -
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
Freier ZugriffDataCite | 2020|Schlagwörter: Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph algorithms -
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
Freier ZugriffDataCite | 2023|Schlagwörter: Mathematics of computing → Graph theory, Mathematics of computing → Combinatorics -
Almost Optimal Distribution-Free Junta Testing
Freier ZugriffDataCite | 2019|Schlagwörter: Mathematics of computing, Mathematics of computing → Discrete mathematics, Mathematics of computing → Probabilistic algorithms
Meine Suche schicken an (beta)
Schicken Sie ihre Suchanfrage (Suchterm ohne Filter) an andere Datenbanken, Portale und Kataloge, um ggf. weitere interessante Treffer zu finden:
Dimensions ist eine Datenbank für Abstracts und Zitate, die Informationen zu Forschungsförderungen mit daraus resultierenden Veröffentlichungen, Studien und Patenten verknüpft.
Im TIB AV-Portal können audiovisuelle Medien aus Wissenschaft und Lehre recherchiert und eigene wissenschaftliche Videos publiziert werden.
Im FID move kann nach fachspezifischer Literatur, Forschungsdaten und weitere Informationen aus der Mobilitäts- und Verkehrsforschung gesucht werden.
Der Open Research Knowledge Graph liefert strukturiert beschriebene Forschungsinhalte und macht diese vergleichbar.
Frei zugänglicher Ausschnitt der Verbunddatenbank K10plus des GBV und des SWB mit für die Fernleihe und Direktlieferdienste relevanten Materialien.