A linear-time algorithm for computing characteristic strings (Englisch)
Nationallizenz
- Neue Suche nach: Nakanishi, Michio
- Neue Suche nach: Hasidume, Morio
- Neue Suche nach: Ito, Minoru
- Neue Suche nach: Hashimoto, Akihiro
- Neue Suche nach: Nakanishi, Michio
- Neue Suche nach: Hasidume, Morio
- Neue Suche nach: Ito, Minoru
- Neue Suche nach: Hashimoto, Akihiro
In:
Algorithms and Computation
;
315-323
;
1994
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:A linear-time algorithm for computing characteristic strings
-
Beteiligte:Nakanishi, Michio ( Autor:in ) / Hasidume, Morio ( Autor:in ) / Ito, Minoru ( Autor:in ) / Hashimoto, Akihiro ( Autor:in )
-
Erschienen in:Algorithms and Computation ; 315-323Lecture Notes in Computer Science ; 834 ; 315-323
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:01.01.1994
-
Format / Umfang:9 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Polynomial equations-solving and its applicationsWen-tsun, Wu et al. | 1994
- 10
-
Quasi-random combinatorial structuresGraham, Ronald L. et al. | 1994
- 11
-
Hamiltonian abstract Voronoi diagrams in linear timeKlein, Rolf / Lingas, Andrzej et al. | 1994
- 20
-
Every set of disjoint line segments admits a binary treeBose, Prosenjit / Houle, Michael E. / Toussaint, Godfried et al. | 1994
- 29
-
The traveling cameraman problem, with applications to automatic optical inspectionIwano, Kazuo / Raghavan, Prabhakar / Tamaki, Hisao et al. | 1994
- 38
-
On determining the congruity of point sets in higher dimensionsAkutsu, Tatsuya et al. | 1994
- 47
-
On random hard sets for NPBook, Ronald V. / Watanabe, Osamu et al. | 1994
- 56
-
Computing solutions uniquely collapses the polynomial hierarchyHemaspaandra, Lane A. / Naik, Ashish V. / Ogihara, Mitsunori / Selman, Alan L. et al. | 1994
- 65
-
Verifying the determinant in parallelSantha, Miklos / Tan, Sovanna et al. | 1994
- 74
-
Hardness of approximating graph transformation problemLin, Chih-Long et al. | 1994
- 83
-
Randomized wait-free namingPanconesi, Alessandro / Papatriantafilou, Marina / Tsigas, Philippas / Vitányi, Paul et al. | 1994
- 92
-
Unifying themes for network selectionRajasekaran, Sanguthevar / Chen, Wang / Yooseph, Shibu et al. | 1994
- 101
-
Robust asynchronous algorithms in networks with a fault detection ringMolcho, M. / Zaks, S. et al. | 1994
- 110
-
Distributed algorithms for finding small cycle covers in arbitrary networksJennings, Esther / Motyčková, Lenka et al. | 1994
- 119
-
A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programmingZhang, Xiang-sun / Zhu, Hui-can et al. | 1994
- 128
-
Analysis of the convergency of topology preserving neural networks on learningDaming, Zhu / Shaohan, Ma / Hongze, Qiu et al. | 1994
- 137
-
On helping and interactive proof systemsArvind, V. / Köbler, J. / Schuler, R. et al. | 1994
- 146
-
Average time complexity of the SAT 1.2 algorithmGu, Jun / Gu, Qian-Ping et al. | 1994
- 155
-
Average cost to produce partial ordersChen, Jingsen et al. | 1994
- 164
-
Two notes on low-density subset sum algorithmDaxing, Li / Shaohan, Ma et al. | 1994
- 172
-
Rotation distance, triangulations of planar surfaces and hyperbolic geometryCai, Jin-Yi / Hirsch, Michael D. et al. | 1994
- 181
-
Finitely representable spatial objects and efficient computationChen, Yongmao / Smith, Terence R. et al. | 1994
- 190
-
Computing all small cuts in undirected networksNagamochi, Hiroshi / Nishimura, Kazuhiro / Ibaraki, Toshihide et al. | 1994
- 199
-
Edge-coloring and f-coloring for various classes of graphsZhou, Xiao / Nishizeki, Takao et al. | 1994
- 208
-
Edge-disjoint paths in permutation graphsGopalakrishnan, C. P. / Pandu Rangan, C. et al. | 1994
- 217
-
Minimum augmentation to k-edge-connect specified vertices of a graphTaoka, Satoshi / Watanabe, Toshimasa et al. | 1994
- 226
-
Algorithmic Chernoff-Hoeffding inequalities in integer programmingSrivastav, Anand / Stangier, Peter et al. | 1994
- 234
-
Approximate pattern matching with samplesTakaoka, Tadao et al. | 1994
- 243
-
An efficient optimal algorithm for minimizing the overall communication cost in replicated data managementLin, Xuemin / Orlowska, Maria E. et al. | 1994
- 252
-
Multispace search: A new optimization approachGu, Jun et al. | 1994
- 261
-
Realizing degree sequences in parallelArikati, Srinivasa / Maheshwari, Anil et al. | 1994
- 270
-
Efficient sequential and parallel algorithms for the negative cycle problemKavvadias, Dimitris / Pantziou, Grammati E. / Spirakis, Paul G. / Zaroliagis, Christos D. et al. | 1994
- 279
-
Fast and efficient operations on Parallel Priority QueuesChen, Danny Z. / Hu, Xiaobo (Sharon) et al. | 1994
- 288
-
Heaps with bitsCarlsson, Svante / Chen, Jingsen / Mattsson, Christer et al. | 1994
- 297
-
Components and projections of curves over finite fieldsGathen, Joachim / Shparlinski, Igor et al. | 1994
- 306
-
On the approximation of finding various minimal, maximal, and consistent sequencesMiddendorf, Martin et al. | 1994
- 315
-
A linear-time algorithm for computing characteristic stringsNakanishi, Michio / Hasidume, Morio / Ito, Minoru / Hashimoto, Akihiro et al. | 1994
- 324
-
The maximum latency and identification of positive Boolean functionsMakino, Kazuhisa / Ibaraki, Toshihide et al. | 1994
- 333
-
Fast deterministic Hot-Potato routing on processor arraysKaufmann, Michael / Lauer, Harald / Schröder, Heiko et al. | 1994
- 342
-
k-pairwise cluster fault tolerant routing in hypercubesGu, Qian-Ping / Peng, Shietung et al. | 1994
- 351
-
On Steiner minimal trees in grid graphs and its application to VLSI routingKaufmann, Michael / Gao, Shaodi / Thulasiraman, K. et al. | 1994
- 360
-
Optimal routing of permutations on ringsShen, Xiaojun / Hu, Qing / Dai, Hao / Wang, Xiangzu et al. | 1994
- 369
-
Resource bounded randomness and weakly complete problemsAmbos-Spies, Klaus / Terwijn, Sebastiaan A. / Xizhong, Zheng et al. | 1994
- 378
-
Deterministic Ω automata vis-a-vis deterministic Buchi automataKrishnan, Sriram C. / Puri, Anuj / Brayton, Robert K. et al. | 1994
- 387
-
Quantum computation and NP-complete problemsMihara, Takashi / Nishino, Tetsuro et al. | 1994
- 396
-
Separability and one-way functionsFortnow, Lance / Rogers, John et al. | 1994
- 405
-
On the approximation of largest common subtrees and largest common point setsAkutsu, Tatsuya / Halldórsson, Magnús M. et al. | 1994
- 414
-
An approximation scheme for some Steiner tree problems in the planeJiang, Tao / Wang, Lusheng et al. | 1994
- 423
-
A chain decomposition algorithm for the proof of a property on minimum weight triangulationsBo-Ting, Yang / Yin-Feng, Xu / Zhao-Yong, You et al. | 1994
- 428
-
Generating algorithm for quasi-full Steiner treeDing, Jiyu et al. | 1994
- 433
-
Analysing deletions in competitive self-adjusting linear list algorithmsKwong Hui, Lucas Chi / Martel, Charles U. et al. | 1994
- 442
-
Are Fibonacci heaps optimal?Abuaiadh, Diab / Kingston, Jeffrey H. et al. | 1994
- 451
-
Simple and efficient graph compression schemes for dense and complement graphsKao, Ming-Yang / Teng, Shang-Hua et al. | 1994
- 460
-
Improved algorithms for coloring random graphsSubramanian, C. R. et al. | 1994
- 469
-
On the parallel complexity of solving recurrence equationsIbarra, Oscar H. / Trân, Nicholas Q. et al. | 1994
- 478
-
Extended graph connectivity and its gradually increasing parallel complexityIwamoto, Chuzo / Iwama, Kazuo et al. | 1994
- 487
-
Parallel h-v drawings of binary treesMetaxas, Panagiotis T. / Pantziou, Grammati E. / Symvonis, Antonis et al. | 1994
- 496
-
An efficient parallel strategy for recognizing series-parallel graphsHsieh, Sun-Yuan / Ho, Chin-Wen et al. | 1994
- 505
-
Orthogonal queries in segments and trianglesTokuyama, Takeshi et al. | 1994
- 514
-
Further computational geometry in secondary memoryZhu, Binhai et al. | 1994
- 523
-
Shortest safari routes in simple polygonsTan, Xuehou / Hirata, Tomio et al. | 1994
- 532
-
On greedy tetrahedralization of points in 3DChin, Francis Y. / Wang, Cao An et al. | 1994
- 541
-
The totally-perfect bipartite graph and its constructionFujiyoshi, Kunihiro / Kajitani, Yoji / Niitsu, Hiroshi et al. | 1994
- 550
-
k Best Cuts for Circular-Arc graphsTsai, K. -H. / Lee, D. T. et al. | 1994
- 559
-
Revisiting circular arc graphsChen, Lin et al. | 1994
- 567
-
Weighted irredundance of interval graphsPandu Rangan, C. / Chang, Maw-Shang et al. | 1994
- 575
-
A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphsTani, Seiichiro / Imai, Hiroshi et al. | 1994
- 584
-
On the size of ordered binary decision diagrams representing threshold functionsHosaka, Kazuhisa / Takenaga, Yasuhiko / Yajima, Shuzo et al. | 1994
- 593
-
Nonuniform lowness and strong nonuniform lownessLi, Hong-Zhou / Li, Guan-Ying et al. | 1994
- 600
-
Definition and existence of super complexity coresBiehl, Ingrid et al. | 1994
- 607
-
Efficient algorithms for assigning chain-like tasks on a chain-like network computerYoung, Gilbert H. / Chan, Chi-Lok et al. | 1994
- 616
-
Manpower scheduling with shift change constraintsLau, Hoong Chuin et al. | 1994
- 625
-
Fast algorithms for transversal matroid intersection problemsXu, Ying / Gabow, Harold N. et al. | 1994
- 634
-
A convex hull algorithm on coarse-grained multiprocessorDeng, Xiaotie et al. | 1994
- 643
-
A multiway merging networkLee, De-Lei / Batcher, Kenneth E. et al. | 1994
- 652
-
Reporting and counting intersections of lines within a polygonAsano, Tetsuo et al. | 1994
- 660
-
A new problem in string searchingHavas, George / Lian, Jin Xian et al. | 1994
- 669
-
Achieving the shortest clock period by inserting the minimum amount of delaySun, Shangzhi / Du, David H. C. / Xue, Guoliang et al. | 1994
- 678
-
A randomized algorithm to Finite Automata Public Key CryptosystemBao, Feng / Igarashi, Yoshihide et al. | 1994