default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 15
Volume 15, Number 1, February 2004
- Oscar H. Ibarra, Louxin Zhang:
Computing And Combinatorics Conference -- Cocoon'02. 1 - Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta:
On Higher Arthur-Merlin Classes. 3-19 - San Skulrattanakulchai, Harold N. Gabow:
Coloring Algorithms On Subcubic Graphs. 21-40 - Lucian Ilie
, Sheng Yu, Kaizhong Zhang:
Word Complexity And Repetitions In Words. 41-55 - Abdullah N. Arslan, Ömer Egecioglu:
Dictionary Look-Up Within Small Edit Distance. 57-71 - Koji Nakano:
Time And Energy Optimal List Ranking Algorithms On The K-Channel Broadcast Communication Model With No Collision Detection. 73-88 - Thanh Minh Hoang, Thomas Thierauf:
On The Minimal Polynomial Of A Matrix. 89-105 - Yvo Desmedt, Yongge Wang:
Analyzing Vulnerabilities Of Critical Infrastructures Using Flows And Critical Vertices In And/Or Graphs. 107-125 - Weimin Ma, Yin-Feng Xu, Jane You, James N. K. Liu, Kanliang Wang:
On The K-Truck Scheduling Problem. 127-141
- Michael Domaratzki:
Improved Bounds On The Number Of Automata Accepting Finite Languages. 143-161 - Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca:
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. 163-185 - Yinlong Xu, Li Lin, Guoliang Chen, Yingyu Wan, Weijun Guo:
Multicasting And Broadcasting In Undirected Wdm Networks And Qos Extentions Of Multicasting. 187-203 - Ricardo Alberich, Mercè Llabrés, Francesc Rosselló:
Single-Pushout Transformation Of Total Algebras. 205-222
Volume 15, Number 2, April 2004
- Eric Rivals:
A Survey On Algorithmic Aspects Of Tandem Repeats Evolution. 225-257 - Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov:
Words Guaranteeing Minimum Image. 259-276 - Alexandru Mateescu, Arto Salomaa:
Matrix Indicators For Subword Occurrences And Ambiguity. 277-292 - Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer:
On The Palindromic Complexity Of Infinite Words. 293-306 - Gwénaël Richomme, Patrice Séébold:
Conjectures And Results On Morphisms Generating K-Power-Free Words. 307-316 - Jeffrey O. Shallit:
Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words. 317-327 - Jacques Justin, Giuseppe Pirillo:
Episturmian Words: Shifts, Morphisms And Numeration Systems. 329-348 - Tero Harju, Dirk Nowotka:
Minimal Duval Extensions. 349-354 - Arturo Carpi, Aldo de Luca:
Repetitions, Fullness, And Uniformity In Two-Dimensional Words. 355-383
- Monaldo Mastrolilli:
Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms. 385-401 - Jacir Luiz Bordim, Oscar H. Ibarra, Yasuaki Ito, Koji Nakano:
Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars. 403-415 - Manolis Gergatsoulis, Christos Nomikos:
A Proof Procedure For Temporal Logic Programming. 417-443 - Chun-Pong Lai, Cunsheng Ding:
Several Generalizations Of Shamir's Secret Sharing Scheme. 445-458
Volume 15, Number 3, June 2004
- Koji Nakano, Jie Wu:
Preface. 459 - Akihiro Fujiwara, Ken-ichi Matsumoto, Wei Chen:
Procedures For Logic And Arithmetic Operations With Dna Molecules. 461-474 - Susumu Matsumae:
Simulation Of Meshes With Separable Buses By Meshes With Multiple Partitioned Buses. 475-484 - Mitali Singh, Viktor K. Prasanna:
A Hierarchical Model For Distributed Collaborative Computation In Wireless Sensor Networks. 485-506 - Lélia Blin, Franck Butelle:
The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs. 507-516 - Dajin Wang, Jiannong Cao:
On Hierarchical Configuration Of Distributed Systems On Mesh And Hypercube. 517-534 - Thomas Rauber, Gudula Rünger:
Program-Based Locality Measures For Scientific Computing. 535-554 - Mojca Ciglaric:
Content Networks: Distributed Routing Decisions In Presence Of Repeated Queries. 555-566
Volume 15, Number 4, August 2004
- Sartaj Sahni, Kun Suk Kim:
Efficient Dynamic Lookup For Bursty Access Patterns. 567-591 - Chung Keung Poon, Wenci Yu:
On Minimizing Total Completion Time In Batch Machine Scheduling. 593-607 - Xiaoyu Li, Howard Barnum:
Quantum Authentication Using Entangled States. 609-617 - Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson:
A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. 619-648 - Dawei Hong, Shushuang Man:
Analysis Of Web Search Algorithm Hits. 649-662 - Jürgen Dassow:
On The Descriptional Complexity Of Lindenmayer Systems. 663-672 - Qingmin Shi, Joseph F. JáJá:
Fast Algorithms For 3-D Dominance Reporting And Counting. 673-684
- Thanh Minh Hoang, Thomas Thierauf:
Erratum: On The Minimal Polynomial Of A Matrix. 685
Volume 15, Number 5, October 2004
- Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi:
From Regular Weighted Expressions To Finite Automata. 687-700 - Alessandro Ferrante, Mimmo Parente:
On The Vertex-Connectivity Problem For Graphs With Sharpened Triangle Inequality. 701-715 - Kevin I.-J. Ho, Joseph Y.-T. Leung:
A Dual Criteria Preemptive Scheduling Problem For Minimax Error Of Imprecise Computation Tasks. 717-731 - Joseph Y.-T. Leung:
Improved Competitive Algorithms For Two-Processor Real-Time Systems. 733-751 - Sahar A. Idwan, Dinesh P. Mehta, Mario Alberto López:
Fast Pursuit Of Mobile Nodes Using TPR Trees. 753-772 - Chung Keung Poon:
Optimal Range Max Datacube For Fixed Dimensions. 773-790 - Katsushi Inoue, Akira Ito, Takashi Kamiura, Holger Petersen, Lan Zhang:
A Note On Rebound Turing Machines. 791-807
Volume 15, Number 6, December 2004
- Jun Luo, Sanguthevar Rajasekaran:
Parallizing 1-Dimensional Estuarine Model. 809-821 - Olivier Finkel:
On Recognizable Languages Of Infinite Pictures. 823-840 - Jaume Casasnovas, Joe Miró, Manuel Moya, Francesc Rosselló:
An Approach To Membrane Computing Under Inexactitude. 841-864 - Farn Wang:
Inductive Composition Of Numbers With Maximum, Minimum, And Addition: A New Theory for Program Execution-Time Analysis. 865-892 - Wing-Kai Hon, Tak Wah Lam, Siu-Ming Yiu, Ming-Yang Kao, Wing-Kin Sung:
Subtree Transfer Distance For Degree-D Phylogenies. 893-909
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
