default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 14
Volume 14, Number 1, February 2003
- Arnold L. Rosenberg:
Efficient Pairing Functions - and Why You Should Care. 3-17 - Albert Y. Zomaya
:
Mobile Computing: Opportunities for Parallel Algorithms Research. 19-37 - Claudia Leopold:
Cache Miss Analysis of 2D Stencil Codes with Tiled Time Loop. 39-58 - Martin Schmollinger, Michael Kaufmann:
Designing Parallel Algorithms for Hierarchical SMP Clusters. 59-78 - Chin-Hsiung Wu, Shi-Jinn Horng:
Scalable and Optimal Speed-Up Parallel Algorithms for Template Matching on Arrays with Reconfigurable Optical Buses. 79-98 - Jie Wu, Stephan Olariu:
On Cost-Optimal Merge of Two Intransitive Sorted Sequences. 99-106 - Vassilis Giakoumakis, Jean-Marie Vanherpe:
Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. 107-136
- Koji Nakano:
Linear Layout of Generalized Hypercubes. 137-156 - Madhu Mutyam:
Probabilistic Rewriting P Systems. 157-166
Volume 14, Number 2, April 2003
- Guangbin Fan, Jingyuan Zhang:
Optimal Cellular Network Deployment Reusing Existing Base Stations. 169-181 - Yu Wang, Xiang-Yang Li, Ophir Frieder:
Distributed Spanners with Bounded Degree for Wireless Ad Hoc Networks. 183-200 - Jie Wu, Fei Dai:
Broadcasting in Ad Hoc Networks Based on Self-Pruning. 201-221 - Alfredo Ferro, Giuseppe Pigola, Alfredo Pulvirenti, Dennis E. Shasha:
Fast Clustering and Minimum Weight Matching Algorithms for Very Large Mobile Backbone Wireless Networks. 223-236 - Justin Lipman, Paul Boustead, John Judge:
Neighbor Aware Adaptive Power Flooding (NAAP) in Mobile Ad Hoc Networks. 237-252 - Julien Cartigny, François Ingelrest, David Simplot:
RNG Relay Subset Flooding Protocols in Mobile Ad-Hoc Networks. 253-265 - Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry:
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. 267-285 - Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder:
Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks. 287-303 - Yuanzhu Peter Chen, Arthur L. Liestman:
A Zonal Algorithm for Clustering An Hoc Networks. 305-322 - Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder:
A Simple Heuristic for Minimum Connected Dominating Set in Graphs. 323-333
Volume 14, Number 3, June 2003
- Sartaj Sahni, Kun Suk Kim, Haibin Lu:
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. 337-358 - Michael A. Palis:
On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees. 359-370 - Ke Qiu, Sajal K. Das:
Interconnection Networks and Their Eigenvalues. 371-389 - Jacir Luiz Bordim, Koji Nakano, Hong Shen:
Sorting on Single-Channel Wireless Sensor Networks. 391-403 - Peiyi Tang, Pen-Chung Yew:
Interprocedural Induction Variable Analysis. 405-423 - Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. 425-437 - Sasthi C. Ghosh, Bhabani P. Sinha, Nabanita Das:
A New Approach to Efficient Channel Assignment for Hexagonal Cellular Networks. 439-463
- Haejae Jung, Sartaj Sahni:
Supernode Binary Search Trees. 465-490 - Shivi Shekhar Bansal, S. Sreekanth, Phalguni Gupta:
M-Heap: A Modified Heap Data Structure. 491-502 - William C. Grimmell, Nageswara S. V. Rao:
On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints. 503-523
Volume 14, Number 4, August 2003
- E. Allen Emerson, Kedar S. Namjoshi:
On Reasoning About Rings. 527-550 - Ahmed Bouajjani, Javier Esparza, Tayssir Touili:
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures. 551-
- Edmund M. Clarke, Ansgar Fehnker, Zhi Han, Bruce H. Krogh, Joël Ouaknine, Olaf Stursberg, Michael Theobald:
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems. 583-604 - Constantinos Bartzis, Tevfik Bultan:
Efficient Symbolic Representations for Arithmetic Constraints in Verification. 605-624 - Deepak D'Souza:
A Logical Characterisation of Event Clock Automata. 625-640 - Li Jiao, To-Yat Cheung:
Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties. 641-658 - Axel Dold, Friedrich W. von Henke, Wolfgang Goerigk:
A Completely Verified Realistic Bootstrap Compiler. 659-
- Kamala Krithivasan, K. Sharda, Sandeep V. Varma:
Distributed varpi -Automata. 681-698 - Juhani Karhumäki, Leonid P. Lisovik:
The Equivalence Problem of Finite Substitutions on ab*c, with Applications. 699-
Volume 14, Number 5, October 2003
- Lov K. Grover:
An Improved Quantum Scheduling Algorithm. 715-722 - Gábor Ivanyos, Frédéric Magniez, Miklos Santha:
Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. 723-740 - Jan Bouda, Vladimír R. Buzek:
Encryption Of Quantum Information. 741-756 - Markus Grassl, Martin Rötteler, Thomas Beth:
Efficient Quantum Circuits For Non-Qubit Quantum Error-Correcting Codes. 757-776 - Andreas Klappenecker, Martin Rötteler:
Quantum Software Reusability. 777-796 - Philippe Jorrand, Mehdi Mhalla:
Separability Of Pure N-Qubit States: Two Characterizations. 797-814 - Tomoyuki Yamakami:
Analysis Of Quantum Functions. 815-852 - Harumichi Nishimura:
Quantum Computation With Restricted Amplitudes. 853-870 - Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Golomb Rulers And Difference Sets For Succinct Quantum Automata. 871-888 - Dominik Janzing, Pawel Wocjan, Thomas Beth:
On The Computational Power Of Physical Interactions: Bounds On The Number Of Time Steps For Simulating Arbitrary Interaction Graphs. 889-
- Anuj Jain, Sartaj Sahni, Jatinder Palta, James Dempsey:
Partitioning 3d Phantoms Into Homogeneous Cuboids. 905-932 - Evgeny Dantsin, Alexander Wolpert:
A Robust Dna Computation Model That Captures Pspace. 933-
Volume 14, Number 6, December 2003
- Mehryar Mohri:
Edit-Distance Of Weighted Automata: General Definitions And Algorithms. 957-982 - Cyril Allauzen, Mehryar Mohri:
Finitely Subsequential Transducers. 983-994 - Cezar Câmpeanu, Andrei Paun:
Counting The Number Of Minimal Dfca Obtained By Merging States. 995-1006 - Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
A Formal Study Of Practical Regular Expressions. 1007-1018 - Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter:
Linear-Time Prime Decomposition Of Regular Prefix Codes. 1019-1032 - Mihaela Gheorghiu, Janusz A. Brzozowski:
Simulation Of Feedback-Free Circuits In The Algebra Of Transients. 1033-1054 - Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe:
Virtual Operations On Virtual Networks: The Priority Union . 1055-1071 - Heiko Körner:
A Time And Space Efficient Algorithm For Minimizing Cover Automata For Finite Languages. 1071-1086 - Markus Holzer, Martin Kutrib:
Nondeterministic Descriptional Complexity Of Regular Languages. 1087-1102 - Alexander Okhotin:
Efficient Automaton-Based Recognition For Linear Conjunctive Languages. 1103-1116 - Klaus Sutner:
Reduced Power Automata And Sofic Systems. 1117-
- David S. L. Wei, Sanguthevar Rajasekaran, Kshirasagar Naik, Sy-Yen Kuo:
Efficient Algorithms For Selection And Sorting Of Large Distributed Files On De Bruijn And Hypercube Structures. 1129-1146 - Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
A General Pram Simulation Scheme For Clustered Machines. 1147-1164 - Paul M. Martini, Walter A. Burkhard:
Double Hashing With Multiple Passbits. 1165-
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 2026-08-06 22:40 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
