Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 88
Volume 88, Numbers 1-2, 17 October 2003
- José Luiz Fiadeiro, Jan Madey, Andrzej Tarlecki
:
Foreword. 1-2 - Jan Madey:
WMT - from a personal perspective. 3-6 - Wladyslaw M. Turski:
It was fun. 7-12 - Michael Jackson:
Why software writing is difficult and will remain so. 13-25 - Cliff B. Jones:
Operational semantics: Concepts and their expression. 27-32 - Meir M. Lehman, Juan F. Ramil:
Software evolution - Background, theory, practice. 33-44 - T. S. E. Maibaum:
On what exactly goes on when software is developed step-by-step, II: The sequel. 45-51 - David Lorge Parnas:
Structured programming: A minor part of software engineering. 53-58 - Michel Sintzoff:
On the design of correct and optimal dynamical systems and games. 59-65 - Krzysztof Walczak, Wojciech Cellary:
Modeling virtual worlds in databases. 67-72 - Józef Winkowski:
An algebraic characterization of independence of Petri net processes. 73-81 - Niklaus Wirth:
Hardware/software co-design then and now. 83-87
Volume 88, Number 3, 15 November 2003
- Kiyoaki Yoshida, Yasumasa Sujaku, Tohru Kohda:
Number of mutual connections in neighborhoods and its application to self-diagnosable systems. 89-94 - Alexandros V. Gerbessiotis, Constantinos J. Siniolakis:
Randomized selection in n+C+o(n) comparisons. 95-100 - Petr Kolman:
A note on the greedy algorithm for the unsplittable flow problem. 101-105 - Noga Alon, Oded Goldreich, Yishay Mansour:
Almost k-wise independence versus k-wise independence. 107-110 - Thorsten Bernholt, Roland Fried:
Computing the update of the repeated median regression line in linear time. 111-117 - Marc Joye:
Cryptanalysis of a pay-as-you-watch system. 119-120 - Darin Goldstein:
Determination of the topology of a directed network. 121-131 - Hasan Ural, David Whittier:
Distributed testing without encountering controllability and observability problems. 133-141
Volume 88, Number 4, 30 November 2003
- Milind Dawande:
A notion of cross-perfect bipartite graphs. 143-147 - Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant cycle-embedding of crossed cubes. 149-154 - Giulia Galbiati:
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. 155-159 - T. C. Edwin Cheng, Zhaohui Liu:
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. 161-165 - Vadim V. Lozin, Dieter Rautenbach:
Some results on graphs without long induced paths. 167-171 - Yin-Te Tsai:
The constrained longest common subsequence problem. 173-176 - Jean-Jacques Hébrard, Bruno Zanuttini:
An efficient algorithm for Horn description. 177-182 - Tzong-Sun Wu, Chien-Lung Hsu, Han-Yu Lin, Po-Sheng Huang:
Improvement of the Miyazaki-Takaragi threshold digital signature scheme. 183-186 - Saurabh Srivastava, R. K. Ghosh:
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network. 187-194 - Jianjun Zhou, Martin Müller:
Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs. 195-200 - Taekyoung Kwon:
Erratum to: "Digital signature algorithm for securing digital identities": [Information Processing Letters 82 (2002) 247-252]. 201-202
Volume 88, Number 5, 16 December 2003
- Liang Chen, Naoyuki Tokuda, Akira Nagai:
A new differential LSI space-based probabilistic document classifier. 203-212 - Lars Kristiansen, Paul J. Voda:
Complexity classes and fragments of C. 213-218 - Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger:
The complexity of economic equilibria for house allocation markets. 219-223 - Wim H. Hesselink:
Salembier's Min-tree algorithm turned into breadth first search. 225-229 - Michael Okun, Amnon Barak:
A new approach for approximating node deletion problems. 231-236 - Keren Horowitz, Dahlia Malkhi:
Estimating network size from local information. 237-243 - Cristian Calude, Solomon Marcus, Ludwig Staiger:
A topological characterization of random sequences. 245-250 - Sean Cleary, Jennifer Taback:
Bounding restricted rotation distance. 251-256 - Anna Gál, Pavel Pudlák:
Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]. 257
Volume 88, Number 6, 31 December 2003
- Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment. 259-270 - Jau-Der Shih:
A fault-tolerant wormhole routing scheme for torus networks with nonconvex faults. 271-278 - Yong-Jin Choi, Ho-Hyun Park, Chin-Wan Chung:
Estimating the result size of a query to velocity skewed moving objects. 279-285 - Toru Araki:
Edge-pancyclicity of recursive circulants. 287-292 - Seong-Hun Paeng:
On the security of cryptosystem using automorphism groups. 293-298 - Pantelimon Stanica, Subhamoy Maitra:
A constructive count of rotation symmetric functions. 299-304 - Jean-Marie Vanherpe:
Some optimization problems on weak-bisplit graphs. 305-310
a service of 
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-04-22 20:02 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
