@article{Hall/93a,
AUTHOR = {Hall, Cordelia V.},
TITLE = {Using overloading to express distinctions between evaluators},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {1-8},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Buchsbaum-Carlisle/93,
AUTHOR = {Buchsbaum, Adam L. and Carlisle, Martin C.},
TITLE = {Determining uni-connectivity in directed graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {9-12},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hachem/93,
AUTHOR = {Hachem, Nabil I.},
TITLE = {An approximate analysis of the performance of extendible hashing with elastic buckets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {13-20},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ahuja/93,
AUTHOR = {Ahuja, Mohan},
TITLE = {Assertions about past and future in Highways: Global flush broadcast and flush-vector-time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {21-28},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yellin-Jutla/93,
AUTHOR = {Yellin, Daniel M. and Jutla, Charanjit S.},
TITLE = {Finding extremal sets in less than quadratic time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {29-34},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hwang/93,
AUTHOR = {Hwang, Tzonelih},
TITLE = {Scheme for secure digital mobile communications based on symmetric key cryptography},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {35-37},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Santos-Orozco/93,
AUTHOR = {Santos, J. and Orozco, J.},
TITLE = {Rate monotonic scheduling in hard real-time systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {39-45},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yu-Yang/93a,
AUTHOR = {Yu, Ming-Shing and Yang, Chen-Hsing},
TITLE = {A simple optimal parallel algorithm for the minimum coloring problem on interval graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {1},
PAGES = {47-51},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Karloff/93,
AUTHOR = {Karloff, Howard},
TITLE = {Fast algorithms for approximately counting mismatches},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {53-60},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Pretolani/93,
AUTHOR = {Pretolani, Daniele},
TITLE = {A linear time algorithm for unique Horn satisfiability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {61-66},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yang/93a,
AUTHOR = {Yang, Wuu},
TITLE = {An incremental LL(1) parsing algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {67-72},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Atkinson-Walker/93,
AUTHOR = {Atkinson, M.D. and Walker, Louise},
TITLE = {Enumerating $k$-way trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {73-75},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Steel-Warnow/93,
AUTHOR = {Steel, Mike and Warnow, Tandy},
TITLE = {Kaikoura tree theorems: Computing the maximum agreement subtree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {77-82},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gartner/93,
AUTHOR = {G{\"a}rtner, Stefan},
TITLE = {A remark on the regulation of $k$IET0L systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {83-85},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chinn-Sinha/93,
AUTHOR = {Chinn, Donald D. and Sinha, Rakesh K.},
TITLE = {Bounds on sample space size for matrix product verification},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {87-91},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gupta/93b,
AUTHOR = {Gupta, Sanjay},
TITLE = {On bounded-probability operators and $C_=P$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {93-98},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Voss/93,
AUTHOR = {Voss, Stefan},
TITLE = {Worst-case performance of some heuristics for Steiner's problem in directed graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {2},
PAGES = {99-105},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tscha-Choi-Lee/93,
AUTHOR = {Tscha, Yeonghwan and Choi, Yanghee and Lee, Kyoon Ha},
TITLE = {Rearrangeable nonblocking condition for multi-$\log_2 N$ multiconnection networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {107-112},
YEAR = {1993},
KEYWORDS = {omputer architecture, nonblocking multi-stage interconnection network, parallel processing, edge-coloring, bipartite multigraph, network},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Shah/93,
AUTHOR = {Shah, Nimish R.},
TITLE = {A parallel algorithm for constructing projection polyhedra},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {113-119},
YEAR = {1993},
KEYWORDS = {computational geometry, parallel algorithms, projection polyhedra, simple cell complexes},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chang-Wang-Kankanhalli/93,
AUTHOR = {Chang, Ee-Chien and Wang, Weiguo and Kankanhalli, Mohan S.},
TITLE = {Multidimensional on-line bin-packing: An algorithm and its average-case analysis},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {121-125},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Fujita-Yamashita/93,
AUTHOR = {Fujita, Satoshi and Yamashita, Masafumi},
TITLE = {Fast gossiping on square mesh computers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {127-130},
YEAR = {1993},
KEYWORDS = {parallel algorithms, gossiping, optimal time bounds, mesh computers},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hensgen-Sims-Charley/93,
AUTHOR = {Hensgen, Debra A. and Sims, David L. and Charley, David},
TITLE = {A fair banker's algorithm for read and write locks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {131-137},
YEAR = {1993},
KEYWORDS = {Banker's algorithm, resource allocation, operating systems, deadlock avoidance, fairness},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sieling-Wegener/93,
AUTHOR = {Sieling, Detlef and Wegener, Ingo},
TITLE = {Reduction of OBDDs in linear time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {139-144},
YEAR = {1993},
KEYWORDS = {binary decision diagrams, data structures for Boolean functions, efficient algorithms, minimization of OBDDs, ordered binary decision diagrams, reduction of OBDDs},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ramarao-Venkatesan/93,
AUTHOR = {Ramarao, K.V.S. and Venkatesan, S.},
TITLE = {The lower bounds on distributed shortest paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {145-149},
YEAR = {1993},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bennaceur-Plateau/93,
AUTHOR = {Bennaceur, Hachemi and Plateau, G{\'e}rard},
TITLE = {An exact algorithm for the constraint satisfaction problem: Application to logical inference},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {3},
PAGES = {151-158},
YEAR = {1993},
KEYWORDS = {constraint satisfaction problem, logical inference, integer programming, branch and cut, automatic theorem proving, combinatorial problems, design of algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Khoong/93,
AUTHOR = {Khoong, C.M.},
TITLE = {Optimal parallel construction of heaps},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {159-161},
YEAR = {1993},
KEYWORDS = {analysis of algorithms, heaps, parallel algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lee-Choe-Han/93,
AUTHOR = {Lee, DongGill and Choe, Kwang-Moo and Han, Taisook},
TITLE = {A description of dynamic behavior for compilers based on object oriented modeling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {163-170},
YEAR = {1993},
KEYWORDS = {compilers, language semantics, object-oriented modeling, dynamic behavior, attribute state, object state, finite state machine},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Reichwein-Fiadeiro/93,
AUTHOR = {Reichwein, Georg and Fiadeiro, Jos{\'e} Luiz},
TITLE = {Models for the substitution axiom of UNITY logic},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {171-176},
YEAR = {1993},
KEYWORDS = {models, UNITY, program modularity, programming languages},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tsai-Tang/93,
AUTHOR = {Tsai, Ying Teh and Tang, Chuan Yi},
TITLE = {The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {177-182},
YEAR = {1993},
KEYWORDS = {analysis of algorithms, on-line algorithms, randomized algorithms, competitive analysis, on-line Steiner tree problem, on-line spanning tree problem},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Fulop-Gyenizse/93,
AUTHOR = {F{\"u}l{\"o}p, Z. and Gyenizse, P.},
TITLE = {On injectivity of deterministic top-down tree transducers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {183-188},
YEAR = {1993},
KEYWORDS = {theory of computation, top-down tree transducers, tree codes, undecidability},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tan-Lu/93a,
AUTHOR = {Tan, Kian-Lee and Lu, Hongjun},
TITLE = {On resource scheduling of multi-join queries in parallel database systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {189-195},
YEAR = {1993},
KEYWORDS = {databases, parallel processing, pipelining, multi-join queries, hash-join},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Paterson-Schroder-Sykora-Vrto/93,
AUTHOR = {Paterson, Michael S. and Schr{\"o}der, Heiko and S{\'y}kora, Ondrej and Vr{\v{t}}o, Imrich},
TITLE = {A short proof of the dilation of a toroidal mesh in a path},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {197-199},
YEAR = {1993},
KEYWORDS = {dilation, embedding, torus, computer architecture, parallel processing},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Buhrman-Torenvliet-van_Emde_Boas/93,
AUTHOR = {Buhrman, Harry and Torenvliet, Leen and van Emde Boas, Peter},
TITLE = {Twenty questions to a p-selector},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {201-204},
YEAR = {1993},
KEYWORDS = {computational complexity},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chang-Liu/93,
AUTHOR = {Chang, Maw-Shang and Liu, Yi-Chang},
TITLE = {Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {4},
PAGES = {205-210},
YEAR = {1993},
KEYWORDS = {algorithms, chordal graphs, split graphs, perfect domination, domination},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Iwano-Katoh/93,
AUTHOR = {Iwano, Kazuo and Katoh, Naoki},
TITLE = {Efficient algorithms for finding the most vital edge of a minimum spanning tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {211-213},
YEAR = {1993},
KEYWORDS = {design and analysis of algorithms, minimum spanning trees, most vital edges},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Johnson-Harathi/93,
AUTHOR = {Johnson, Theodore and Harathi, Krishna},
TITLE = {A simple correctness proof of the MCS contention-free lock},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {215-220},
YEAR = {1993},
KEYWORDS = {mutual exclusion, concurrency, data structures, parallel processing, spin lock},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Grinstead-Slater-Sherwani-Holmes/93,
AUTHOR = {Grinstead, Dana L. and Slater, Peter J. and Sherwani, Naveed A. and Holmes, Nancy D.},
TITLE = {Efficient edge domination problems in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {221-228},
YEAR = {1993},
KEYWORDS = {combinatorial problems, graph theory, edge domination},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kavraki-Latombe-Wilson/93,
AUTHOR = {Kavraki, Lydia and Latombe, Jean-Claude and Wilson, Randall H.},
TITLE = {On the complexity of assembly partitioning},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {229-235},
YEAR = {1993},
KEYWORDS = {computational complexity, computational geometry, assembly planning, motion planning},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sheu-Liaw-Chen/93,
AUTHOR = {Sheu, Jang-Ping and Liaw, Wen-Hwa and Chen, Tzung-Shi},
TITLE = {A broadcasting algorithm in star graph interconnection networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {237-241},
YEAR = {1993},
KEYWORDS = {broadcasting, interconnection networks, parallel processing, star graphs},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rouskov-Srimani/93,
AUTHOR = {Rouskov, Yordan and Srimani, Pradip K.},
TITLE = {Fault diameter of star graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {243-251},
YEAR = {1993},
KEYWORDS = {fault tolerance, star graphs, routing, algorithms, fault diameter},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Golin-Sedgewick/93,
AUTHOR = {Golin, Mordecai J. and Sedgewick, Robert},
TITLE = {Queue-mergesort},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {253-259},
YEAR = {1993},
KEYWORDS = {algorithms, mergesort, Huffman enconding, binary trees},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Billionnet/93,
AUTHOR = {Billionnet, Alain},
TITLE = {Partitioning multiple-chain-like task across a host-satellite system},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {5},
PAGES = {261-266},
YEAR = {1993},
KEYWORDS = {algorithms, analysis of algorithms, host-satellite system, pipelining, tast allocation, dynamic programming, complexity},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Culik-Kari/93,
AUTHOR = {Culik II, Karel and Kari, Jarkko},
TITLE = {Parametrized recurrent systems for image generation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {267-274},
YEAR = {1993},
KEYWORDS = {image generation, fractal geometry, computational geometry},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rodrigues-Ural/93,
AUTHOR = {Rodrigues, Marion and Ural, Hasan},
TITLE = {Exact solutions for the construction of optimal length text sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {275-280},
YEAR = {1993},
KEYWORDS = {design of algorithms, finite state machines, testing},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Vincent-Srinivasan/93a,
AUTHOR = {Vincent, Millist W. and Srinivasan, Bala},
TITLE = {A note on relation schemes which are in 3NF but not in BCNF},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {281-283},
YEAR = {1993},
KEYWORDS = {databases, relational databases, normalization, third normal form, Boyce-Codd normal form},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Inoue-Ito-Takanami-Yoshinaga/93,
AUTHOR = {Inoue, Katsushi and Ito, Akira and Takanami, Itsuo and Yoshinaga, Tsunehiro},
TITLE = {A note on multi-inkdot nondeterministic Turing machines with small space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {285-288},
YEAR = {1993},
KEYWORDS = {computational complexity, space bounded computations, nondeterministic Turing machines, inkdot Turing machines},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Pillaipakkamnatt-Raghavan/93,
AUTHOR = {Pillaipakkamnatt, Krishnan and Raghavan, Vijay},
TITLE = {A linear time equivalence test for read-twice DNF formulas},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {289-295},
YEAR = {1993},
KEYWORDS = {algorithms, equivalence testing, Boolean functions, DNF formulas},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Fraigniaud-Kenyon-Pelc/93,
AUTHOR = {Fraigniaud, Pierre and Kenyon, Claire and Pelc, Andrzej},
TITLE = {Finding a target subnetwork in sparse networks with random faults},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {297-303},
YEAR = {1993},
KEYWORDS = {fault-tolerance, random graphs},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Goldschmidt-Hochbaum-Yu/93,
AUTHOR = {Goldschmidt, Olivier and Hochbaum, Dorit S. and Yu, Gang},
TITLE = {A modified greedy heuristic for the set covering problem with improved worst case bound},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {305-310},
YEAR = {1993},
KEYWORDS = {algorithms, analysis of algorithms, combinatorial problems, computational complexity, design of algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Dankelmann/93,
AUTHOR = {Dankelmann, Peter},
TITLE = {Computing the average distance of an interval graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {311-314},
YEAR = {1993},
KEYWORDS = {algorithms, graph algorithms, average distance, interval graphs},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ho-Leung-Wei/93,
AUTHOR = {Ho, Kevin I.-J. and Leung, Joseph Y.-T. and Wei, W.-D.},
TITLE = {Complexity of scheduling tasks with time-dependent execution times},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {48},
NUMBER = {6},
PAGES = {315-320},
YEAR = {1993},
KEYWORDS = {NP-complete, algorithms, polynomial-time algorithm, nonpreemptive schedule, release time, deadline, feasible schedule, single processor},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}