Oskar-Bordeaux: envíos recientes
Mostrando ítems 3101-3120 de 97095
-
Supporting Experimental Computer Science
Rapport -
PSEUDOE: A computational method to detect Psi-genes and explore PSEUDome dynamics in wine bacteria from the Oenococcus genus.
Communication dans un congrès -
High-Order Optimal Edge Elements for Pyramids, Prisms and Hexahedra
(Journal of Computational Physics. vol. 232, n° 1, pp. 189-213, 2013-01)Article de revue -
QIRAL: A High Level Language for Lattice QCD Code Generation
Communication dans un congrès -
A fully coupled RANS Spalart-Allmaras SUPG formulation for turbulent compressible flows on stretched-unstructured grids
(Computer Methods in Applied Mechanics and Engineering. vol. 233-236, pp. 109-122, 2012-04-19)Article de revue -
Silicic acid flux to the ocean from tidal permeable sediments: A modeling study
(Computers & Geosciences. vol. 43, pp. 52-62, 2012-02-28)Article de revue -
Calculation of Ice Chunk Trajectory Using Proper Orthogonal Decomposition
Communication dans un congrès -
A NEW PARTICLE SET OF CONTOURS METHOD FOR ADVECTION-DIFFUSION PROBLEMS APPLIED TO THE MODELLING OF WASTE DISPOSAL
Communication dans un congrès -
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Communication dans un congrès -
The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations
Communication dans un congrès -
How to meet when you forget: log-space rendezvous in arbitrary graphs
(Distributed Computing. vol. 25, n° 2, pp. 165-178, 2012)Article de revue -
Graph Decomposition for Memoryless Periodic Exploration
(Algorithmica. vol. 63, n° 1-2, pp. 26-38, 2012)Article de revue -
Time vs. space trade-offs for rendezvous in trees
Communication dans un congrès -
Maximum Matching in Multi-Interface Networks
Communication dans un congrès -
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
Communication dans un congrès -
More efficient periodic traversal in anonymous undirected graphs
(Theoretical Computer Science. vol. 444, pp. pages 60-76, 2012-07)Article de revue -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
(Algorithmica. vol. 62, n° 3-4, pp. pages 1006-1033, 2012-04)Article de revue