- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Frankfurt am Main, 2001
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2005
- Urheber
- URN
-
urn:nbn:de:hebis:30-12018
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 14.08.2025, 10:44 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek.
Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Schnorr, Claus Peter
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2005
Ähnliche Objekte (12)
Fast approximate shortest paths in the congested clique
Computing Shortest Lattice Vectors on Special Hardware
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
k-shortest path: average-case analysis and practical improvements
Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks
Practical lattice basis sampling reduction
Vector SIMP dark matter with approximate custodial symmetry
Acceleration of Shortest Path and Constrained Shortest Path Computation
Linguistic-Valued Approximate Reasoning With Lattice Ordered Linguistic-Valued Credibility
Shortest Paths II
Shortest Paths II
Fast approximate shortest paths in the congested clique
Computing Shortest Lattice Vectors on Special Hardware
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
k-shortest path: average-case analysis and practical improvements
Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks
Practical lattice basis sampling reduction
Vector SIMP dark matter with approximate custodial symmetry
Acceleration of Shortest Path and Constrained Shortest Path Computation
Linguistic-Valued Approximate Reasoning With Lattice Ordered Linguistic-Valued Credibility
Shortest Paths II
Shortest Paths II
Fast approximate shortest paths in the congested clique
Computing Shortest Lattice Vectors on Special Hardware
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
k-shortest path: average-case analysis and practical improvements
Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks
Practical lattice basis sampling reduction
Vector SIMP dark matter with approximate custodial symmetry
Acceleration of Shortest Path and Constrained Shortest Path Computation
Linguistic-Valued Approximate Reasoning With Lattice Ordered Linguistic-Valued Credibility
Shortest Paths II