Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 72
Volume 72, Numbers 1-2, 29 October 1999
- Fausto Montoya Vitini, Jaime Muñoz Masqué, Alberto Peinado Domínguez:
Linear Complexity of the x2 Mod p Orbits. 3-7 - Antonín Kucera
:
Regularity of Normed PA Processes. 9-17 - Yue Wang, Katsushi Inoue, Akira Ito, Tokio Okazaki:
A Note on Self-Modifying Finite Automata. 19-24 - Z. M. Ma, Wen-Jun Zhang, Weiyin Ma:
Assessment of Data Redundancy in Fuzzy Relational Databases Based on Semantic Inclusion Degree. 25-29 - John A. Mount:
Estimating the Range of a Function in an Online Setting. 31-35 - Dong-Yul Ra, George C. Stockman:
A New one Pass Algorithm for Estimating Stochastic Context-Free Grammars. 37-45 - Jürg Nievergelt, Narsingh Deo, Ambros Marzetta:
Memory-Efficient Enumeration of Constrained Spanning Trees. 47-53 - Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings. 55-63 - Gonzalo Navarro, Ricardo A. Baeza-Yates:
Very Fast and Simple Approximate String Matching. 65-70 - Valmir Carneiro Barbosa, Jayme Luiz Szwarcfiter:
Generating all the Acyclic Orientations of an Undirected Graph. 71-74
Volume 72, Numbers 3-4, November 1999
- Chien-Yuan Chen, Chin-Chen Chang:
A fast modular multiplication algorithm for calculating the product AB modulo N. 77-81 - Martín Matamala, Klaus Meer:
On the computational structure of the connected components of a hard problem. 83-90 - Michel Raynal, Frederic Tronel:
Restricted failure detectors: Definition and reduction protocols. 91-97 - Graham M. Megson, Xiaofan Yang, Xiaoping Liu:
Honeycomb tori are Hamiltonian. 99-103 - Samir Khuller:
An O(|V|2) algorithm for single connectedness. 105-107 - Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang:
The correct diameter of trivalent Cayley graphs. 109-111 - Ioan I. Macarie, Joel I. Seiferas:
Amplification of slight probabilistic advantage at absolutely no cost in space. 113-118 - Yann Verhoeven:
Random 2-SAT and unsatisfiability. 119-123 - Christian Lavault, Sidi Mohamed Sedjelmaci:
Worst-case analysis of Weber's GCD algorithm. 125-130 - Shien-Ching Hwang, Gen-Huey Chen:
A note on cyclic-cubes. 131-135 - Tiziana Calamoneri, Annalisa Massini:
An optimal layout of multigrid networks. 137-141 - K. Sridharan:
Computing two penetration measures for curved 2D objects. 143-148
Volume 72, Numbers 5-6, 30 December 1999
- Xiaoyi Jiang, Horst Bunke:
Optimal Vertex Ordering of Graphs. 149-154 - Petr Jancar:
A Note on Well Quasi-Orderings for Powersets. 155-160 - Karen I. Aardal, Fabián A. Chudak, David B. Shmoys:
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. 161-167 - Carlo Blundo, Alfredo De Santis, Antonio Giorgio Gaggia:
Probability of Shares in Secret Sharing Schemes. 169-175 - George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis:
A New Algorithm for Rectangle Enclosure Reporting. 177-182 - Ramesh Krishnamurti, Daya Ram Gaur:
An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems. 183-188 - Gyung-Ok Lee, Kwang-Moo Choe:
An LR Parser with Pre-Determined Reduction Goals. 189-196 - Sven Kosub:
A Note on Unambiguous Function Classes. 197-203 - Jae-Young Chang, Sang-goo Lee:
Extended Conditions for Answering an Aggregate Query Using Materialized Views. 205-212 - Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee:
An Optimal Embedding of Cycles into Incomplete Hypercubes. 213-218
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-25 05:28 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:
