default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 10
Volume 10, Number 1, March 1999
- Seonghun Cho, Sartaj Sahni:
Mergeable Double-Ended Priority Queues. 1-18 - G. Sajith, Sanjeev Saxena:
Parallel Vertex Colouring of Interval Graphs. 19-32 - Mehmet Hakan Karaata:
A Self-Stabilizing Algorithm for Finding Articulation Points. 33-46 - Yoojin Chung, Kunsoo Park, Yookin Cho:
Parallel Maximum Matching Algorithms in Interval Graphs. 47-60 - Jürgen Dassow, Henning Fernau, Gheorghe Paun:
On the Leftmost Derivation in Matrix Grammars. 61-80 - Kamil Saraç, Ömer Egecioglu, Amr El Abbadi:
DFT Techniques for Size Estimation of Database Join Operations. 81-102 - Florian Roussel, Irena Rusu, Henri Thuillier:
On Graphs with Limited Number of P4-Partners. 103-122
Volume 10, Number 2, June 1999
- Koji Nakano, Stephan Olariu:
Guest Editors' Introduction. 123-126 - Florian Roussel, Irena Rusu:
Holes and Dominoes in Meyniel Graphs. 127-146 - Michel Habib, Christophe Paul, Laurent Viennot:
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. 147-170 - Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. 171-194 - Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki:
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. 195-210 - Savio S. H. Tse, Francis C. M. Lau:
On the Complexity of Some Adaptive Polling Algorithms in General Networks. 211-224 - Michael Holzrichter, Suely Oliveira
:
A Graph Based Davidson Algorithm for the Graph Partitioning Problem. 225-246
Volume 10, Number 3, September 1999
- Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal, José Luis E. Dos Santos:
Deviation Algorithms for Ranking Shortest Paths. 247-262 - Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Self-Specifying Machines. 263-276 - Tiziana Calamoneri, Rossella Petreschi:
Optimal Layout of Trivalent Cayley Interconnection Networks. 277-288 - M. Cemil Azizoglu, Ömer Egecioglu:
The Isoperimetric Number of d-Dimensional k-Ary Arrays. 289-300 - Kim S. Larsen:
On Grouping in Relational Algebra. 301-311 - Axel W. Krings, Moshe Dror:
Real-Time Dispatching: Scheduling Stability and Precedence. 313-328 - Johann A. Makowsky, Udi Rotics:
On the Clique-Width of Graphs with Few P4's. 329-348 - Sergio Greco, Domenico Saccà, Carlo Zaniolo:
Grammars and Automata to Optimize Chain Logic Queries. 349-372
Volume 10, Number 4, December 1999
- Daniel Andresen, Tao Yang:
Selected Papers from Irregular 1999 - Preface. Int. J. Found. Comput. Sci. 10(4): 373- (1999) - Henrique Mongelli, Siang W. Song:
Parallel Range Minima on Coarse Grained Multicomputers. 375-390 - Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Deterministic Branch-and-Bound on Distributed Memory Machines. 391-404 - Cristina Boeres, Aline de Paula Nascimento, Vinod E. F. Rebello:
Cluster-Based Task Scheduling for the LOGP Model. 405-424 - Frédérique Voisin, Guy-René Perrin:
Sparse Computation with PEI. 425-442
- Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha:
Distributed Processing in Automata. 443-464 - Alan P. Sprague, Tadao Takaoka:
O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs. 465-472 - Ryuhei Uehara:
A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits. 473-482 - Takeshi Okadome:
Simple Flat Languages: A Learnable Class in the Limit from Positive Data. 483-502 - Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Minimizing Congestion of Layouts for ATM Networks with Faulty Links. 503-512 - Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe:
Bipartite Graphs Totally Decomposable by Canonical Decomposition. 513-534 - Richard Beigel, Anna Bernasconi:
A Note on the Polynomial Representation of Boolean Functions over GF(2). 535-
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 2025-11-28 23:55 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:
