標(biāo)題: Titlebook: Algorithms - ESA ‘93; First Annual Europea Thomas Lengauer Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Algorithmen.A [打印本頁(yè)] 作者: Blandishment 時(shí)間: 2025-3-21 18:52
書(shū)目名稱Algorithms - ESA ‘93影響因子(影響力)
書(shū)目名稱Algorithms - ESA ‘93影響因子(影響力)學(xué)科排名
書(shū)目名稱Algorithms - ESA ‘93網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Algorithms - ESA ‘93網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Algorithms - ESA ‘93被引頻次
書(shū)目名稱Algorithms - ESA ‘93被引頻次學(xué)科排名
書(shū)目名稱Algorithms - ESA ‘93年度引用
書(shū)目名稱Algorithms - ESA ‘93年度引用學(xué)科排名
書(shū)目名稱Algorithms - ESA ‘93讀者反饋
書(shū)目名稱Algorithms - ESA ‘93讀者反饋學(xué)科排名
作者: insular 時(shí)間: 2025-3-21 21:44 作者: ADORE 時(shí)間: 2025-3-22 00:26
Parallel approximation schemes for problems on planar graphs,This paper describes a technique to obtain NC Approximations Schemes for the Maximun Independent Set in planar graphs and related optimization problems.作者: 返老還童 時(shí)間: 2025-3-22 07:12 作者: 領(lǐng)巾 時(shí)間: 2025-3-22 12:22 作者: 一條卷發(fā) 時(shí)間: 2025-3-22 16:46 作者: STELL 時(shí)間: 2025-3-22 20:33
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs,e communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Here, the complexity of gossiping in grids and in planar graphs is investigated. The main results are the following:作者: LINE 時(shí)間: 2025-3-23 00:40 作者: Parley 時(shí)間: 2025-3-23 04:04 作者: GORGE 時(shí)間: 2025-3-23 08:36 作者: facetious 時(shí)間: 2025-3-23 13:17 作者: convulsion 時(shí)間: 2025-3-23 16:48
,Gesch?ftsmodell des Online-Handels,njecture strongly in the straight line algorithm model. Therefore, if the strong direct sum conjecture is true for the quadratic algorithm model then it is also true for the straight line algorithm model.作者: averse 時(shí)間: 2025-3-23 19:38
Risk-Benefit des New Online- Retailing,e communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Here, the complexity of gossiping in grids and in planar graphs is investigated. The main results are the following:作者: 話 時(shí)間: 2025-3-24 00:38
Best Practices im New Online- Retailing,st whether the insertion of a new edge would violate the planarity of the embedding. Our data structure supports online updates and queries on an .-vertex embedded planar graph in .(log..) worst-case time, it can be built in linear time and requires linear storage.作者: FIR 時(shí)間: 2025-3-24 03:18 作者: Spinous-Process 時(shí)間: 2025-3-24 09:01 作者: 聲明 時(shí)間: 2025-3-24 13:38
https://doi.org/10.1007/978-3-658-11934-8 be executed efficiently on a smaller one? In this work we give several positive answers to the self simulation problem on dynamically reconfigurable meshes. We show that the simulation of a reconfiguring mesh by a smaller one can be carried optimally, by using standard methods, on meshes such that 作者: modest 時(shí)間: 2025-3-24 16:11
https://doi.org/10.1007/978-3-658-11934-8rd planarity and constructing upward planar drawings is important for displaying hierarchical network structures, which frequently arise in software engineering, project management, and visual languages. In this paper we investigate upward planarity testing of single-source digraphs: we provide a ne作者: 異教徒 時(shí)間: 2025-3-24 19:18 作者: 兇猛 時(shí)間: 2025-3-25 01:11 作者: ATRIA 時(shí)間: 2025-3-25 06:40 作者: Favorable 時(shí)間: 2025-3-25 10:28
,Gesch?ftsmodell des Online-Handels,is class of problems includes the evaluation of linear expressions over .-tuples from a semiring with binary and unary operators, attribute grammars with linear dependencies, point location in binary space partitions, compaction of slicing floorplans, graph drawing, generalized heaps, and a variety 作者: 聽(tīng)寫(xiě) 時(shí)間: 2025-3-25 11:59
https://doi.org/10.1007/978-3-658-28204-2concurrent read exclusive write parallel random-access machine (CREW PRAM). In particular, we provide algorithms for counting the number of points that are directly dominated by each point of a planar point set, and for reporting these point sets. The counting algorithm runs in .(log .) time using .作者: 發(fā)源 時(shí)間: 2025-3-25 17:20
Best Practices im New Online-Retailing, certain height restrictions. The height level map is used to store ., such that for any two query points, one can decide whether there exists a path on . between the two points whose height decreases monotonically. More generally, one can compute the minimum height difference along any path between作者: CALL 時(shí)間: 2025-3-25 21:08
Best Practices im New Online-Retailing,elocities. The first variation addresses the question: given a point .. and time .. who is the nearest postman to .. at time ..? We present a randomized incremental data structure that answers the query in expected .(log..) time. The second variation views a query point as a dog searching for a post作者: BIAS 時(shí)間: 2025-3-26 02:06 作者: 同謀 時(shí)間: 2025-3-26 05:03
https://doi.org/10.1007/978-3-8349-8065-6ally specifiable by grammars involving union, product, set, sequence, and cycle constructions. A general strategy is developed for solving the random generation problem with two closely related types of methods: for structures of size ., the boustrophedonic algorithms exhibit a worst-case behaviour 作者: 墻壁 時(shí)間: 2025-3-26 12:24 作者: 不真 時(shí)間: 2025-3-26 14:33
Risk-Benefit des New Online- Retailing,e communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Here, the complexity of gossiping in grids and in planar graphs is investigated. The main results are the following:作者: 高原 時(shí)間: 2025-3-26 17:45
Best Practices im New Online- Retailing,st whether the insertion of a new edge would violate the planarity of the embedding. Our data structure supports online updates and queries on an .-vertex embedded planar graph in .(log..) worst-case time, it can be built in linear time and requires linear storage.作者: 補(bǔ)助 時(shí)間: 2025-3-26 22:38
Conference proceedings 1993submitted in response to the call forpapers, aswell as three invited lectures: "Evolution of an algorithm"by Michael Paterson, "Complexity of disjoint paths problemsin planar graphs" by Alexander Schrijver, and"Sequencecomparison and statistical significance in molecularbiology" by Michael S. Waterman.作者: 事情 時(shí)間: 2025-3-27 04:26
https://doi.org/10.1007/978-3-8349-7082-4ounds were .(. log .) for this shortest paths problem, and .(. log .) for the minimum-weight circle-cover problem. Thus we improve the bounds of both problems. More importantly, the techniques we give hold the promise of achieving similar log .-factor improvements in other problems on such graphs.作者: refine 時(shí)間: 2025-3-27 09:00 作者: 商品 時(shí)間: 2025-3-27 11:16 作者: Valves 時(shí)間: 2025-3-27 17:24
Best Practices im New Online- Retailing,ingle processor, which then distributes the final results to the whole network. The importance of bit complexity — as opposed to message complexity — stems also from the fact that in the lower bound discussion, no assumptions are made as to the nature of the algorithm.作者: 灌溉 時(shí)間: 2025-3-27 21:28
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applicatounds were .(. log .) for this shortest paths problem, and .(. log .) for the minimum-weight circle-cover problem. Thus we improve the bounds of both problems. More importantly, the techniques we give hold the promise of achieving similar log .-factor improvements in other problems on such graphs.作者: 統(tǒng)治人類(lèi) 時(shí)間: 2025-3-28 02:01
Efficient self simulation algorithms for reconfigurable arrays,f the underlying mesh efficient simulations are presented, paying by an extra factor which is polylogarithmic in the size of the simulated mesh. Although the self simulation algorithms are complex and require extensive bookkeeping operations, the required space is asymptotically optimal.作者: Myofibrils 時(shí)間: 2025-3-28 02:33
Optimal upward planarity testing of single-source digraphs, .(.) space. The algorithm also constructs an upward planar drawing if the test is successful. The previous best result is an .(..)-time algorithm by Hutton and Lubiw. No efficient parallel algorithms for upward planarity testing were previously known.作者: 表臉 時(shí)間: 2025-3-28 09:12
The bit complexity of distributed sorting,ingle processor, which then distributes the final results to the whole network. The importance of bit complexity — as opposed to message complexity — stems also from the fact that in the lower bound discussion, no assumptions are made as to the nature of the algorithm.作者: Confess 時(shí)間: 2025-3-28 10:38
Conference proceedings 1993l series ofinternational conferences, held in early fall, covering thefield of algorithms. Within the scope of the symposium liesall research on algorithms, theoretical as well as applied,that is carried out in the fields of computer science anddiscrete applied mathematics. The symposium aims to cat作者: 玩忽職守 時(shí)間: 2025-3-28 16:01 作者: 戰(zhàn)役 時(shí)間: 2025-3-28 20:12
,Gesch?ftsmodell des Online-Handels,ith linear dependencies, point location in binary space partitions, compaction of slicing floorplans, graph drawing, generalized heaps, and a variety of optimization problems in bounded tree-width graphs. For problems in this class, we support a complete repertory of dynamic operations in logarithmic time using linear space.作者: 貴族 時(shí)間: 2025-3-29 00:17 作者: Pituitary-Gland 時(shí)間: 2025-3-29 07:09
The influence of lookahead in competitive paging algorithms,n-line paging algorithms. This is the first model of lookahead having such properties. In addition to lower bounds we present a number of deterministic and randomized on-line paging algorithms with strong lookahead which are optimal or nearly optimal.作者: OASIS 時(shí)間: 2025-3-29 08:28
On bufferless routing of variable-length messages in leveled networks,and we show how efficient chatting schedules can often be produced from efficient virtual chatting schedules. We present a number of strategies for producing efficient virtual chatting schedules on a variety of network topologies.作者: aplomb 時(shí)間: 2025-3-29 13:38 作者: 依法逮捕 時(shí)間: 2025-3-29 18:09 作者: Microgram 時(shí)間: 2025-3-29 22:24 作者: CRAB 時(shí)間: 2025-3-30 02:41
Risk-Benefit des New Online- Retailing,lgorithm design methodologies. The proofs of these three results are related in interesting ways which suggest useful heuristic connections between the three complexity frameworks for intractable problems of bounded treewidth and pathwidth.作者: Diaphragm 時(shí)間: 2025-3-30 04:34 作者: BUDGE 時(shí)間: 2025-3-30 08:33
DNA physical mapping: Three ways difficult,lgorithm design methodologies. The proofs of these three results are related in interesting ways which suggest useful heuristic connections between the three complexity frameworks for intractable problems of bounded treewidth and pathwidth.作者: 組成 時(shí)間: 2025-3-30 12:23 作者: 圣人 時(shí)間: 2025-3-30 17:33
Best Practices und Risiken im Online-Handel,and we show how efficient chatting schedules can often be produced from efficient virtual chatting schedules. We present a number of strategies for producing efficient virtual chatting schedules on a variety of network topologies.作者: manifestation 時(shí)間: 2025-3-31 00:10
https://doi.org/10.1007/978-3-658-28204-2(.) processors; the reporting algorithm runs in .(log .) time using .(./log .) processors, where . is the size of the output. The total work of each algorithm matches the respective sequential lower bound. As an application of our results, we present an algorithm for the maximum empty rectangle problem, which is work optimal in the expected case.作者: Contracture 時(shí)間: 2025-3-31 00:52 作者: 圣歌 時(shí)間: 2025-3-31 05:33
The influence of lookahead in competitive paging algorithms,the present request and a sequence of future requests that contains . pairwise distinct pages. These pages also differ from the page requested by the present request. We show that strong lookahead has practical as well as theoretical importance and significantly improves the competitive factors of o作者: 易怒 時(shí)間: 2025-3-31 10:28 作者: thrombus 時(shí)間: 2025-3-31 13:27
Efficient self simulation algorithms for reconfigurable arrays, be executed efficiently on a smaller one? In this work we give several positive answers to the self simulation problem on dynamically reconfigurable meshes. We show that the simulation of a reconfiguring mesh by a smaller one can be carried optimally, by using standard methods, on meshes such that 作者: intercede 時(shí)間: 2025-3-31 20:36 作者: bleach 時(shí)間: 2025-3-31 23:51 作者: 漂亮才會(huì)豪華 時(shí)間: 2025-4-1 05:11 作者: 輕彈 時(shí)間: 2025-4-1 08:10
On the direct sum conjecture in the straight line model,njecture strongly in the straight line algorithm model. Therefore, if the strong direct sum conjecture is true for the quadratic algorithm model then it is also true for the straight line algorithm model.作者: 幻影 時(shí)間: 2025-4-1 12:48 作者: MURAL 時(shí)間: 2025-4-1 17:32
