Ultimamente añadido

Mostrando ítems 3101-3120 de 97095

Las cookies de este sitio web no contienen ninguna clase de información personal específica, solo permiten recoger datos sobre su navegación. Más información…

Oskar-Bordeaux: envíos recientes

Supporting Experimental Computer Science

PSEUDOE: A computational method to detect Psi-genes and explore PSEUDome dynamics in wine bacteria from the Oenococcus genus.

Cracking the Pseudome Code: Inside the "silent" Psi-genes language to reconstruct Oenococcus oeni evolutionary adaptation to wine

High-Order Optimal Edge Elements for Pyramids, Prisms and Hexahedra

QIRAL: A High Level Language for Lattice QCD Code Generation

A fully coupled RANS Spalart-Allmaras SUPG formulation for turbulent compressible flows on stretched-unstructured grids

Silicic acid flux to the ocean from tidal permeable sediments: A modeling study

Calculation of Ice Chunk Trajectory Using Proper Orthogonal Decomposition

A NEW PARTICLE SET OF CONTOURS METHOD FOR ADVECTION-DIFFUSION PROBLEMS APPLIED TO THE MODELLING OF WASTE DISPOSAL

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels

The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations

The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations

How to meet when you forget: log-space rendezvous in arbitrary graphs

Graph Decomposition for Memoryless Periodic Exploration

Time vs. space trade-offs for rendezvous in trees

Maximum Matching in Multi-Interface Networks

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences

More efficient periodic traversal in anonymous undirected graphs

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles

Adding Virtualization Capabilities to Grid'5000

Oskar-Bordeaux: envíos recientes

Supporting Experimental Computer Science ﻿

PSEUDOE: A computational method to detect Psi-genes and explore PSEUDome dynamics in wine bacteria from the Oenococcus genus. ﻿

Cracking the Pseudome Code: Inside the "silent" Psi-genes language to reconstruct Oenococcus oeni evolutionary adaptation to wine ﻿

High-Order Optimal Edge Elements for Pyramids, Prisms and Hexahedra ﻿

QIRAL: A High Level Language for Lattice QCD Code Generation ﻿

A fully coupled RANS Spalart-Allmaras SUPG formulation for turbulent compressible flows on stretched-unstructured grids ﻿

Silicic acid flux to the ocean from tidal permeable sediments: A modeling study ﻿

Calculation of Ice Chunk Trajectory Using Proper Orthogonal Decomposition ﻿

A NEW PARTICLE SET OF CONTOURS METHOD FOR ADVECTION-DIFFUSION PROBLEMS APPLIED TO THE MODELLING OF WASTE DISPOSAL ﻿

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels ﻿

The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations ﻿

The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations ﻿

How to meet when you forget: log-space rendezvous in arbitrary graphs ﻿

Graph Decomposition for Memoryless Periodic Exploration ﻿

Time vs. space trade-offs for rendezvous in trees ﻿

Maximum Matching in Multi-Interface Networks ﻿

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences ﻿

More efficient periodic traversal in anonymous undirected graphs ﻿

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles ﻿

Adding Virtualization Capabilities to Grid'5000 ﻿

Supporting Experimental Computer Science

PSEUDOE: A computational method to detect Psi-genes and explore PSEUDome dynamics in wine bacteria from the Oenococcus genus.

Cracking the Pseudome Code: Inside the "silent" Psi-genes language to reconstruct Oenococcus oeni evolutionary adaptation to wine

High-Order Optimal Edge Elements for Pyramids, Prisms and Hexahedra

QIRAL: A High Level Language for Lattice QCD Code Generation

A fully coupled RANS Spalart-Allmaras SUPG formulation for turbulent compressible flows on stretched-unstructured grids

Silicic acid flux to the ocean from tidal permeable sediments: A modeling study

Calculation of Ice Chunk Trajectory Using Proper Orthogonal Decomposition

A NEW PARTICLE SET OF CONTOURS METHOD FOR ADVECTION-DIFFUSION PROBLEMS APPLIED TO THE MODELLING OF WASTE DISPOSAL

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels

The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations

The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations

How to meet when you forget: log-space rendezvous in arbitrary graphs

Graph Decomposition for Memoryless Periodic Exploration

Time vs. space trade-offs for rendezvous in trees

Maximum Matching in Multi-Interface Networks

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences

More efficient periodic traversal in anonymous undirected graphs

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles

Adding Virtualization Capabilities to Grid'5000