Search alternatives:
shortcut » shortcuts
shortest » shorter
shortests » shorters, hortests, shortess, shortlists
Cover Image
Read Now

281
Published 1993
Springer Berlin Heidelberg
Table of Contents: “... -- Covering a string -- On the worst-case behaviour of some approximation algorithms for the shortest common...”
Cover Image
Read Now

282
Published 2022
Springer International Publishing
Table of Contents: “... -- 16. Shortest Path Computing with Networks of Memristors -- 17. Cellular Nanoscale Networks...”
Cover Image
Read Now

283
Published 2022
Springer International Publishing
Table of Contents: “... Smart City: Autonomous Vehicles, Cryptocurrency, and Contract Law -- Finding all shortest meaningful...”
Cover Image
Read Now

284
Published 2020
Springer International Publishing
Table of Contents: “...) -- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata -- Longer shortest strings...”
Cover Image
Read Now

285
Published 1992
Springer Berlin Heidelberg
Table of Contents: “... shortest paths -- Minimal shared information for concurrent reading and writing -- Reading many variables...”
Cover Image
Read Now

286
Published 2021
Springer International Publishing
Table of Contents: “... -- An Experimental Study on Exact Multi-Constraint Shortest Path Finding -- The Effect of Regional Economic Clusters...”
Cover Image
Read Now

287
Published 2003
Springer Berlin Heidelberg
Table of Contents: “... -- Circularity Conditions on Stationary Axisymmetric Einstein-Yang-Mills Fields -- The Shortest Cut in Brane...”
Cover Image
Read Now

288
Published 2004
Springer Berlin Heidelberg
Table of Contents: “...A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence...”
Cover Image
Read Now

289
Published 2006
Springer Berlin Heidelberg
Table of Contents: “... Sensing -- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree...”
Cover Image
Read Now

290
Published 2022
Springer International Publishing
Table of Contents: “... -- Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs -- Non-Crossing Shortest Paths in Undirected...”
Cover Image
Read Now

291
by Paul, Sanjoy
Published 1998
Springer US
Table of Contents: “... Multicast -- 3 Multicast Routing Algorithms -- 4 IP Multicast -- 5 Multicast Extensions to Open Shortest...”
Cover Image
Read Now

292
Published 2005
Springer Berlin Heidelberg
Table of Contents: “... -- Inferring AS Relationships: Dead End or Lively Beginning? -- Acceleration of Shortest Path and Constrained...”
Cover Image
Read Now

293
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... Network -- Three Results on Frequency Assignment in Linear Cellular Networks -- Link Distance and Shortest...”
Cover Image
Read Now

294
Published 2024
Springer Nature Switzerland
Table of Contents: “... Using Improved Detours and Shortest Route on Distributed Key Value Store Based on Order Preserving...”
Cover Image
Read Now

295
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... for Shortest Path Problems -- Techniques and Tools for Local Search Landscape Visualization and Analysis...”
Cover Image
Read Now

296
Published 2018
Springer International Publishing
Table of Contents: “... Wavelet Transformation for Text Similarity Recognition -- Tweet integration by finding the shortest paths...”
Cover Image
Read Now

297
Published 1999
Springer Berlin Heidelberg
Table of Contents: “... Shortest Paths Efficiently -- Image Watermarking for Copyright Protection -- Algorithms for NP-Hard...”
Cover Image
Read Now

298
Published 2021
Springer International Publishing
Table of Contents: “... algorithm for the shortest superstring problem are equivalent -- String Covers of a Tree -- Compression...”
Cover Image
Read Now

299
Published 1997
Springer Berlin Heidelberg
Table of Contents: “... -- Average-case complexity of shortest-paths problems in the vertex-potential model -- Approximation...”
Cover Image
Read Now

300
Published 2008
Springer Berlin Heidelberg
Table of Contents: “... and Web Search -- Average Update Times for Fully-Dynamic All-Pairs Shortest Paths -- Computing Frequency...”