default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 66
Volume 66, Number 1, 15 April 1998
- Fanica Gavril
, Oded Shmueli:
Intersection Graphs of k-Acyclic Families of Subtrees and Relational Database Query Processing. 1-6 - Alexander Moshe Rabinovich:
Non-Elementary Lower Bound for Propositional Duration Calculus. 7-11 - Klaus W. Wagner:
A Note on Parallel Queries and the Symmetric-Difference Hierarchy. 13-20 - Cunsheng Ding, Tor Helleseth:
On Cyclotomic Generator of Order r. 21-25 - Eisuke Dannoura, Kouichi Sakurai:
An Improvement on El-Yaniv-Fiat-Karp-Turpin's Money-Making Bi-Directional Trading Strategy. 27-33 - Ion I. Mandoiu:
Optimum Extensions of Prefix Codes. 35-40 - Walter Hower:
Revisiting Global Constraint Satisfaction. 41-48 - Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda:
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. 49-52
Volume 66, Number 2, 29 April 1998
- Beate Bollig, Ingo Wegener:
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. 53-57 - Flaminia L. Luccio:
Almost Exact Minimum Feedback Vertex Set in Meshes and Butterflies. 59-64 - Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan:
Weighted Irredundance of Interval Graphs. 65-70 - Christel Baier, Marta Z. Kwiatkowska:
On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints. 71-79 - Sven Oliver Krumke, Hans-Christoph Wirth:
On the Minimum Label Spanning Tree Problem. 81-85 - Chor Ping Low:
A Fast Search Algorithm for the Quorumcast Routing Problem. 87-92 - Ge-Ming Chiu:
A Fault-Tolerant Broadcasting Algorithm for Hypercubes. 93-99 - Tadakazu Sato:
Surjective Linear Cellular Automata over Zm. 100-104 - JaeCheol Ha, Sang-Jae Moon:
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation. 105-107
Volume 66, Number 3, 15 May 1998
- Ernst Althaus, Kurt Mehlhorn:
Maximum Network Flow with Floating Point Arithmetic. 109-113 - Chongkye Rhee:
On the Chromatic Index of Graphs with 2m + 1 Vertices and 2m2 Edges. 115-118 - Nakhoon Baek, Sung Yong Shin:
On Circularly-Hidden Surface Removal. 119-123 - Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments. 125-126 - Guoliang Xue, Shangzhi Sun, J. Ben Rosen:
Fast Data Transmission and Maximal Dynamic Flow. 127-132 - Chan-Su Shin, Sung Kwon Kim, Sung-Ho Kim, Kyung-Yong Chwa:
Algorithms for Drawing Binary Trees in the Plane. 133-139 - Seongyeol Kim, Ilyong Chung:
Application of the Special Latin Square to a Parallel Routing Algorithm on a Recursive Circulant Network. 141-147 - Bruce E. Litow, Bernard Mans:
A Note on the Ádám Conjecture for Double Loops. 149-153 - Vassil S. Dimitrov, Graham A. Jullien, William C. Miller:
An Algorithm for Modular Exponentiation. 155-159 - Carlos Cabrelli, Ursula Molter:
A Linear Time Algorithm for a Matching Problem on the Circle. 161-164
Volume 66, Number 4, 29 May 1998
- Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara:
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. 165-170 - Sándor P. Fekete, William R. Pulleyblank:
Traveling the Boundary of Minkowski Sums. 171-174 - Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro:
Efficient Token-Based Control in Rings. 175-180 - Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka:
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. 181-186 - Youzou Miyadera, Koushi Anzai, Hiroshi Unno, Takeo Yaku:
Depth-First Layout Algorithm for Trees. 187-194 - Hiroshi G. Okuno, Shin-ichi Minato, Hideki Isozaki:
On the Properties of Combination Set Operations. 195-199 - Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang, Lih-Hsing Hsu:
Fault Tolerant Token Ring Embedding in Double Loop Networks. 201-207 - Hiro Ito, Mitsuo Yokoyama:
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. 209-213 - Wei-Kuo Chiang, Rong-Jaye Chen:
On the Arrangement Graph. 215-219
Volume 66, Number 5, 16 June 1998
- Edward A. Luke, Ioana Banicescu, Jin Li:
The Optimal Effectiveness Metric for Parallel Application Analysis. 223-229 - Duncan K. G. Campbell:
On the CLUMPS Model of Parallel Computation. 231-236 - Jonathan M. Nash:
Scalable and Predictable Performance for Irregular Problems Using the WPRAM Computational Model. 237-246 - Jin-Soo Kim, Soonhoi Ha, Chu Shik Jhon:
Relaxed Barrier Synchronization for the BSP Model of Computation on Message-Passing Architectures. 247-253 - Jens Simon, Jens-Michael Wierum:
The Latency-of-Data-Access Model for Analyzing Parallel Computation. 255-261 - Clark D. Thomborson:
The Economics of Large-Memory Computations. 263-268 - Bruce M. Maggs, Eric J. Schwabe:
Real-Time Emulations of Bounded-Degree Networks. 269-276
Volume 66, Number 6, 30 June 1998
- Christos Makris, Athanasios K. Tsakalidis:
Algorithms for Three-Dimensional Dominance Searching in Linear Space. 277-283 - Masaaki Mizuno, Mikhail Nesterenko:
A Transformation of Self-Stabilizing Serial Model Programs for Asynchronous Parallel Computing Environments. 285-290 - S. Schwarz, Sven Oliver Krumke:
On Budget-Constrained Flow Improvement. 291-297 - Abdellah Salhi, Hugh Glaser, David De Roure:
Parallel Implementation of a Genetic-Programming Based Tool for Symbolic Regression. 299-307 - Jiun-Liang Chen, Feng-Jian Wang:
An Inheritance Flow Model for Class Hierarchy Analysis. 309-315 - Tsu-Miin Hsieh, Yi-Shiung Yeh, Yung-Cheng Hsieh, Chan-Chi Wang:
A Homophonic DES. 317-320 - Gianluca De Marco, Ugo Vaccaro:
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults. 321-326
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-02-08 23:07 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:
