Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 69
Volume 69, Number 1, 15 January 1999
- François Denis:
Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete. 1-5 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. 7-13 - Jitender S. Deogun, K. Gopalakrishnan:
Consecutive Retrieval Property-Revisited. 15-20 - Soo Hak Sung, Seongtaek Chee, Choonsik Park:
Global Avalanche Characteristics and Propagation Criterion of Balanced Boolean Functions. 21-24 - Tycho Strijk, Marc J. van Kreveld:
Labeling a Rectilinear Map More Efficiently. 25-30 - Jichiang Tsai, Yi-Min Wang, Sy-Yen Kuo:
Evaluations of Domino-Free Communication-Induced Checkpointing Protocols. 31-37 - Jae-Ha Lee, Kyung-Yong Chwa:
Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem. 39-45 - Paul Kruszewski:
A Note on the Horton-Strahler Number for Random Binary Search Trees. 47-51
Volume 69, Number 2, 29 January 1999
- Guo-Hui Lin, Guoliang Xue:
Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length. 53-57 - Henning Bordihn, Markus Holzer
:
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. 59-62 - Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. 63-67 - Ju-Hong Lee, Guang-Ho Cha, Chin-Wan Chung:
A Model for k-Nearest Neighbor Query Processing Cost in Multidimensional Data Space. 69-76 - S. R. Chauhan, Iain A. Stewart:
On the Power of Built-In Relations in Certain Classes of Program Schemes. 77-82 - Marius Zimand:
Relative to a Random Oracle, P/Poly is not Measurable in EXP. 83-86 - Chin-Wen Ho, Jou-Ming Chang:
Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs. 87-93 - Chih-Hung Wang, Tzonelih Hwang, Narn-Yih Lee:
Comments on Two Group Signatures. 95-97 - Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. Levitin, Dimiter R. Avresky:
On the Covering of Vertices for Fault Diagnosis in Hypercubes. 99-103
Volume 69, Number 3, 12 February 1999
- Pierre Crégut, Barbara Heyd:
Progress Properties for Empty UNITY Programs. 107-109 - Zheng Wang:
On the Complexity of Quality of Service Routing. 111-114 - Yongge Wang:
A Separation of Two Randomness Concepts. 115-118 - Hong-Chung Chen, Yue-Li Wang, Yu-Feng Lan:
A Memory-Efficient and Fast Huffman Decoding Algorithm. 119-122 - Dominique Roelants van Baronaigien:
A Multi-Stack Method for the Fast Generation of Permutations with Minimal Length Increasing Subsequences. 123-126 - Leizhen Cai, Yin-Feng Xu, Binhai Zhu:
Computing the Optimal Bridge Between Two Convex Polygons. 127-130 - Douglas R. Stinson, Ruizhong Wei:
An Application of Ramp Schemes to Broadcast Encryption. 131-135 - Rajeev Alur, Doron A. Peled:
Undecidability of Partial Order Logics. 137-143 - Jovan Dj. Golic:
Stream Cipher Encryption of Random Access Files. 145-148 - Igor Terekhov, Tracy Camp:
Time Efficient Deadlock Resolution Algorithms. 149-154 - Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi:
Independent Spanning Trees of Chordal Rings. 155-160
Volume 69, Number 4, 26 February 1999
- Noriko Sugimoto, Hiroki Ishizaka:
Generating Languages by a Derivation Procedure for Elementary Formal Systems. 161-166 - Jin-yi Cai:
A Classification of the Probabilistic Polynomial Time Hierarchy Under Fault Tolerant Access to Oracle Classes. 167-174 - Carsten Damm:
Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. 175-179 - Vikraman Arvind, Jacobo Torán:
Sparse Sets, Approximable Sets, and Parallel Queries to NP. 181-188 - Gabriel Robins, Brian L. Robinson, Bhupinder S. Sethi:
On Detecting Spatial Regularity in Noisy Images. 189-195 - A. Arvind, C. Pandu Rangan:
Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue. 197-199 - Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. 201-206 - Valery A. Nepomniaschy:
Symbolic Verification Method for Definite Iteration over Data Structures. 207-213
Volume 69, Number 5, 12 March 1999
- Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz:
New Results on MWT Subgraphs. 215-219 - Pierre-Yves Schobbens, Jean-François Raskin:
The Logic of "Initially" and "Next": Complete Axiomatization and Complexity. 221-225 - L. Javier García-Villalba, Amparo Fúster-Sabater:
On the General Classification of Nonlinear Filters of m-Sequences. 227-232 - Masaaki Mizuno:
A Structured Approach for Developing Concurrent Programs in Java. 233-238 - Joseph Cheriyan, Kurt Mehlhorn:
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. 239-242 - Kuo-Qin Yan, Shu-Chin Wang, Yeh-Hao Chin:
Consensus Under Unreliable Transmission. 243-248 - Damu Radhakrishnan, Adimathara P. Preethy:
A Parallel Approach to Direct Analog-to-Residue Conversion. 249-252 - Marco A. Torres, Susumu Kuroyanagi, Akira Iwata:
The Self-Indexed Search Algorithm: A Bit-Level Approach to Minimal Perfect Hashing. 253-258 - Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca:
Meeting Times of Random Walks on Graphs. 259-265
Volume 69, Number 6, 26 March 1999
- Stasys Jukna:
Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. 267-269 - Manfred Göbel:
A Rewriting Technique for Universal Polynomial Invariants. 271-273 - Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng:
Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines. 275-281 - Marek Chrobak, Christoph Dürr:
Reconstructing hv-Convex Polyominoes from Orthogonal Projections. 283-289 - Yannick Saouter, Hervé Le Verge:
Computability of Affine Non-Conditional Recurrent Systems. 291-295 - Wen-Guey Tzeng, Chi-Ming Hu:
Inter-Protocol Interleaving Attacks on Some Authentication and Key Distribution Protocols. 297-302 - H. Manos:
Construction of Halvers. 303-307 - Lance Fortnow:
Relativized Worlds with an Infinite Hierarchy. 309-313
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-18 21:11 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:
