Titlebook: Algorithm Engineering; 5th International Wo Gerth St?lting Brodal,Daniele Frigioni,Alberto Mar Conference proceedings 2001 Springer-Verlag

嚴(yán)厲

書目名稱Algorithm Engineering影響因子(影響力)




書目名稱Algorithm Engineering影響因子(影響力)學(xué)科排名




書目名稱Algorithm Engineering網(wǎng)絡(luò)公開度




書目名稱Algorithm Engineering網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithm Engineering被引頻次




書目名稱Algorithm Engineering被引頻次學(xué)科排名




書目名稱Algorithm Engineering年度引用




書目名稱Algorithm Engineering年度引用學(xué)科排名




書目名稱Algorithm Engineering讀者反饋




書目名稱Algorithm Engineering讀者反饋學(xué)科排名

IST

Gerth St?lting Brodal,Daniele Frigioni,Alberto MarIncludes supplementary material:

GRUEL

世俗

https://doi.org/10.1007/3-540-44688-5algorithm engineering; algorithms; data structures; discrete algorithms; experimental algorithmics; netwo

angiography

978-3-540-42500-7Springer-Verlag Berlin Heidelberg 2001

無辜

https://doi.org/10.1007/978-3-030-88124-5tomaton (NFA) construction algorithm, we are able to encode the DFA using (.+ 1)(2. + |Σ|) bits, where . is the number of characters (excluding operator symbols) in the regular expression and Σ is the alphabet. This compares favorably against the worst case of (. + 1)2.|Σ| bits needed by a classical

Introduction

https://doi.org/10.1007/978-981-16-4979-0differences. The program . is a simple and practical bit-vector algorithm for this problem. In this paper we consider the following incremental version of the problem: given an appropriate encoding of a comparison between . and ., can one compute the answer for . and ., and the answer for . and . wi

Adherent

Interstellar Medium Scale I: Galaxy Size,d predictable locality at all levels of the memory hierarchy, with no . knowledge of the specific memory system organization for any particular machine. By both simulations and execution on a number of platforms, we show that memory hierarchies portability does not sacrifice floating point performan

bacteria

El?bieta Go?ata,Bernadette Jondaockwise-allocated pile (a heap without the order property). The data structure is easily explainable provided that one knows the classical heap concept. All core deque operations are performed in .(1) worst-case time. Also, general modifying operations are provided which run in .(√.) time if the str

使顯得不重要

https://doi.org/10.1007/978-3-531-90911-0as plane graphs and planar maps, polyhedral surfaces and boundary representations (BREPs), two-dimensional views of a three dimensional scene, etc. Many variants have been proposed in the literature, starting with the winged-edge data structure of Baumgart[.], the DCEL of [.,.], the quad-edge data s