Nardelli et al.
2001
A faster computation of the most vital edge of a shortest path
Alstrup et al.
2005
Labeling schemes for small distances in trees
Choffrut
2003
Minimizing subsequential transducers: a survey
Tradler et al.
2006
Algebraic string operations
Julliard et al.
2006
Identifying autumn migration routes for the globally threatened Aquatic Warbler Acrocephalus paludicola
DE1318138U
(OSRAM )
Kanazawa
2016
Multidimensional trees and a Chomsky–Schützenberger–Weir representation theorem for simple context-free tree grammars
Imielińska et al.
1993
A greedy heuristic for a minimum-weight forest problem
Grandcolas et al.
1996
The origin of protistan symbionts in termites and cockroaches: a phylogenetic perspective
Retoré
1996
Perfect matchings and series-parallel graphs: multiplicatives proof nets as r&b-graphs
KR900018674A
(ko )
1990-12-22
폴리에틸렌 증발 덮개
Joshi et al.
2000
Moduli of vector bundles on curves in positive characteristics
Pfitzner
2007
Separable L‐embedded Banach spaces are unique preduals
Kadir
2022
2-Quasi crossed modules of commutative algebras
Shimoji
2004
On the equivalence of weak dominance and sequential best response
Di Guardia et al.
2023
Sequentialization is as fun as bungee jumping
Lai et al.
2006
Group chromatic number of planar graphs of girth at least 4
ES2117031T3
(es )
1998-08-01
Composiciones polimericas autoextinguentes.
Morrill et al.
2008
Proof nets for basic discontinuous Lambek calculus
Kac et al.
2005
Representations of the exceptional Lie superalgebra E (3, 6) III: Classification of singular vectors
Manvel et al.
1978
Nearly acyclic graphs are reconstructible
Raadik
1992
Aquatic fauna of East Gippsland: fish and macroinvertebrates
Rhodes et al.
2012
Further results on monoids acting on trees
Gyu-Hyeok
2005
BS-PLC (Both Side-Packet Loss Concealment) for CELP Coder
Jun
2004
(− 2, 3, 7)-pretzel knot and Reebless foliation