@article{Gianuzzi/94,
AUTHOR = {Gianuzzi, Vittoria},
TITLE = {Distributed termination detection in reducible communication graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {1-8},
YEAR = {1994},
KEYWORDS = {distributed computing, termination detection, reducible graphs},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Nuutila-Soisalon-Soininen/94,
AUTHOR = {Nuutila, Esko and Soisalon-Soininen, Eljas},
TITLE = {On finding the strongly connected components in a directed graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {9-14},
YEAR = {1994},
KEYWORDS = {design of algorithms, strongly connected components, Tarjan's algorithm, transitive closure},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Goldmann-Grape-Hastad/94,
AUTHOR = {Goldmann, Mikael and Grape, Per and H{\aa}stad, Johan},
TITLE = {On average time hierarchies},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {15-20},
YEAR = {1994},
KEYWORDS = {computational complexity, average time complexity, hierarchy theorems},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kanchanasut/94,
AUTHOR = {Kanchanasut, Kanchana},
TITLE = {A shortest-path algorithm for Manhattan graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {21-25},
YEAR = {1994},
KEYWORDS = {algorithms, graph algorithms, Manhattan graphs, shortest path},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Belbaraka-Stojmenovic/94,
AUTHOR = {Belbaraka, Mounir and Stojmenovi{\'c}, Ivan},
TITLE = {On generating B-trees with constant average delay and in lexicographic order},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {27-32},
YEAR = {1994},
KEYWORDS = {B-tree, lexicographic order, generating combinatorial objects, design of algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Veljan/94,
AUTHOR = {Veljan, D.},
TITLE = {Computing values of a polynomial with only few multiplications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {33-37},
YEAR = {1994},
KEYWORDS = {algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ting-Yao/94,
AUTHOR = {Ting, Hing F. and Yao, Andrew C.},
TITLE = {A randomized algorithm for finding maximum with $O((\log n)^2)$ polynomial tests},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {39-43},
YEAR = {1994},
KEYWORDS = {algorithms, decision trees, maximum, parity tests, randomized algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rhee-Liang-Dhall-Lakshmivarahan/94,
AUTHOR = {Rhee, C. and Liang, Y. Daniel and Dhall, S.K. and Lakshmivarahan, S.},
TITLE = {Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {45-50},
YEAR = {1994},
KEYWORDS = {breadth-first search, depth-first search, permutation graph, algorithms, combinatorial problems},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kaplan-Shamir/94,
AUTHOR = {Kaplan, Haim and Shamir, Ron},
TITLE = {The domatic number problem on some perfect graph families},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {51-56},
YEAR = {1994},
KEYWORDS = {algorithm, computational complexity, domatic number, domatic partition, strongly chordal graphs, chordal graphs, bipartite graphs, classes of perfect graphs, totally balanced hypergraphs},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Singh/94,
AUTHOR = {Singh, Gurdip},
TITLE = {Real-time leader election},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {57-61},
YEAR = {1994},
KEYWORDS = {distributed computing, real-time systems, election},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Jung-Choe-Han/94,
AUTHOR = {Jung, Min-Soo and Choe, Kwang-Moo and Han, Taisook},
TITLE = {An efficient computation of right context for LR-based error repair},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {63-71},
YEAR = {1994},
KEYWORDS = {compilers, LR parsing, syntax error repair, Kernel item, right context},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Saxena/94,
AUTHOR = {Saxena, Sanjeev},
TITLE = {Two-coloring linked lists is $NC^1$-complete for logarithmic space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {73-76},
YEAR = {1994},
KEYWORDS = {computational complexity, parallel algorithms, linked list, $NC ^1$, connected components},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gemmell-Harchol/94,
AUTHOR = {Gemmell, Peter and Harchol, Mor},
TITLE = {Tight bounds on expected time to add correctly and add mostly correctly},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {77-83},
YEAR = {1994},
KEYWORDS = {algorithms, addition},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Steinbach/94,
AUTHOR = {Steinbach, Joachim},
TITLE = {Generating polynomial orderings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {85-93},
YEAR = {1994},
KEYWORDS = {theory of computation, term rewriting systems, termination, polynomial orderings},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Mairson/94,
AUTHOR = {Mairson, Harry G.},
TITLE = {Generating words in a context-free language uniformly at random},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {95-99},
YEAR = {1994},
KEYWORDS = {algorithms, analysis of algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Klop-Middeldorp-Toyama-Vrijer/94,
AUTHOR = {Klop, Jan Willem and Middeldorp, Aart and Toyama, Yoshihito and Vrijer, Roel de},
TITLE = {Modularity of confluence: A simplified proof},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {101-109},
YEAR = {1994},
KEYWORDS = {theory of computation, term rewriting systems, modularity, confluence},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Amir-Farach-Muthukrishnan/94,
AUTHOR = {Amir, Amihood and Farach, Martin and Muthukrishnan, S.},
TITLE = {Alphabet dependence in parameterized matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {111-115},
YEAR = {1994},
KEYWORDS = {algorithms, analysis of algorithms, string matching, parameterized string matching, software maintenance},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kim/94a,
AUTHOR = {Kim, Sung Kwon},
TITLE = {The range co-minima problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {117-121},
YEAR = {1994},
KEYWORDS = {algorithms, analysis of algorithms, data structures},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ladermann-Petersen/94,
AUTHOR = {Ladermann, M. and Petersen, H.},
TITLE = {Notes on looping deterministic two-way pushdown automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {123-127},
YEAR = {1994},
KEYWORDS = {theory of computation, automata, formal languages},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Li-Chang/94,
AUTHOR = {Li, Tze Fen and Chang, Sung Wu},
TITLE = {An algorithm to estimate the fraction defective and the exponential mean life using unlabeled samples},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {129-133},
YEAR = {1994},
KEYWORDS = {algorithms, classification, estimation, mixture distribution, pattern recognition, unsupervised learning},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Shibata-Shirahata-Osawa/94,
AUTHOR = {Shibata, Yukio and Shirahata, Miyuki and Osawa, Shingo},
TITLE = {Counting closed walks in generalized de Bruijn graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {135-138},
YEAR = {1994},
KEYWORDS = {combinatorial problems, generalized de Bruijn graph, counting, closed walk},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Panda-Mohanty/94,
AUTHOR = {Panda, B.S. and Mohanty, S.P.},
TITLE = {Recognition algorithm for intersection graphs of edge disjoint paths in a tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {139-143},
YEAR = {1994},
KEYWORDS = {intersection graph, parallel processing, analysis of algorithms, computational complexity},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Jovanovic-Misic/94,
AUTHOR = {Jovanovi{\'c}, Zoran and Mi{\v{s}}i{\'c}, Jelena},
TITLE = {Fault tolerance of the star graph interconnection network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {145-150},
YEAR = {1994},
KEYWORDS = {computer architecture, interconnection networks, multicomputers, star graph},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bonet-Buss/94,
AUTHOR = {Bonet, Maria Luisa and Buss, Samuel R.},
TITLE = {Size-depth tradeoffs for Boolean formulae},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {151-155},
YEAR = {1994},
KEYWORDS = {theory of computation, Boolean formulas, formulae complexity, size-depth tradeoff},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yang-Dhall-Lakshmivarahan/94,
AUTHOR = {Yang, S.B. and Dhall, S.K. and Lakshmivarahan, S.},
TITLE = {A processor efficient MIS algorithm on random graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {157-163},
YEAR = {1994},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wang/94d,
AUTHOR = {Wang, Chien-Min},
TITLE = {A new routing algorithm for cyclic shifts on BRGC hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {165-169},
YEAR = {1994},
KEYWORDS = {cyclic shifts, embedding, hypercubes, parallel processing, routing algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Huang-Huang-Wang/94,
AUTHOR = {Huang, Nen-Fu and Huang, Ching-Ho and Wang, Yue-Li},
TITLE = {A sweepline algorithm to solve the two-center problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {171-177},
YEAR = {1994},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{de_Luca-Mione/94,
AUTHOR = {de Luca, Aldo and Mione, Licia},
TITLE = {On bispecial factors of the Thue-Morse word},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {179-183},
YEAR = {1994},
KEYWORDS = {overlap-free words, special factors, (strictly) bispecial factors, formal languages, combinatorics on words},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Leuchner-Miller-Slutzki/94,
AUTHOR = {Leuchner, John H. and Miller, Les and Slutzki, Giora},
TITLE = {A note on the equivalence of a set of egds to a set of FDs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {185-188},
YEAR = {1994},
KEYWORDS = {databases, data dependencies, analysis of algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Calvert/94,
AUTHOR = {Calvert, Ken},
TITLE = {Eliminating disjunctions of leads-to properties},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {189-194},
YEAR = {1994},
KEYWORDS = {concurrency, formal semantics, specification languages, temporal logic, UNITY},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Neiger/94,
AUTHOR = {Neiger, Gil},
TITLE = {Distributed consensus revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {195-201},
YEAR = {1994},
KEYWORDS = {arbitrary failures, Byzantine agreement, distributed computing, distributed consensus, synchronous systems},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kim-Park/94,
AUTHOR = {Kim, Dongseung and Park, Joonyoung},
TITLE = {Two-way dominant sequence clustering for processor scheduling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {203-208},
YEAR = {1994},
KEYWORDS = {parallel processing, compilers, operating systems},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Cheng-Cunningham/94,
AUTHOR = {Cheng, Eddie and Cunningham, Willliam H.},
TITLE = {A faster algorithm for computing the strength of a network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {209-212},
YEAR = {1994},
KEYWORDS = {algorithms, network survivability, ratio minimization},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kakugawa-Fujita-Yamashita-Ae/94,
AUTHOR = {Kakugawa, Hirotsugu and Fujita, Satoshi and Yamashita, Masafumi and Ae, Tadashi},
TITLE = {A distributed $k$-mutual exclusion algorithm using $k$-coterie},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {213-218},
YEAR = {1994},
KEYWORDS = {distributed systems, mutual exclusion, critical section},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Khardon/94,
AUTHOR = {Khardon, Roni},
TITLE = {On using the Fourier transform to learn disjoint DNF},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {219-222},
YEAR = {1994},
KEYWORDS = {algorithms, computational learning, membership queries, DNF, Fourier transform},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Paul/94,
AUTHOR = {Paul, Wolfgang J.},
TITLE = {A note on bitonic sorting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {223-225},
YEAR = {1994},
KEYWORDS = {bitonic sort., parallel sorting, analysis of algorithms, parallel processing, parallel algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{van_Wezel-Tel/94,
AUTHOR = {van Wezel, Michiel C. and Tel, Gerard},
TITLE = {An assertional proof of Rana's algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {227-233},
YEAR = {1994},
KEYWORDS = {analysis of algorithms, distributed computing, program correctness},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Breslauer/94,
AUTHOR = {Breslauer, Dany},
TITLE = {Testing string superprimitivity in parallel},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {235-241},
YEAR = {1994},
KEYWORDS = {parallel algorithms, string matching, periods, quasiperiods, superprimitivity},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tiwari-Tompa/94,
AUTHOR = {Tiwari, Prasoon and Tompa, Martin},
TITLE = {A direct version of Shamir and Snir's lower bounds on monotone circuit depth},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {243-248},
YEAR = {1994},
KEYWORDS = {arithmetic circuits, formula depth, parallel algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Zhang-Jiang/94,
AUTHOR = {Zhang, Kaizhong and Jiang, Tao},
TITLE = {Some MAX SNP-hard results concerning unordered labeled trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {249-254},
YEAR = {1994},
KEYWORDS = {computational complexity},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kolountzakis/94a,
AUTHOR = {Kolountzakis, Mihail N.},
TITLE = {Selection of a large sum-free subset in polynomial time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {255-256},
YEAR = {1994},
KEYWORDS = {algorithms, combinatorial problems, additive number theory},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wuu-Huang/94,
AUTHOR = {Wuu, Lih-Chyau and Huang, Shing-Tsaan},
TITLE = {Identity assignment in uniform synchronous rings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {257-262},
YEAR = {1994},
KEYWORDS = {distributed computing, fault tolerance, identity assignment, self-stabilization},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Pemmaraju-Shaffer/94,
AUTHOR = {Pemmaraju, Sriram V. and Shaffer, Clifford A.},
TITLE = {Analysis of the worst case space complexity of a PR quadtree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {263-267},
YEAR = {1994},
KEYWORDS = {data structures, spacial data structures, worst case analysis, PR quadtree, point data},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Tel/94a,
AUTHOR = {Tel, Gerard},
TITLE = {Maximal matching stabilizes in quadratic time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {271-272},
YEAR = {1994},
KEYWORDS = {distributed systems, maximal matching, self-stabilization, variant function},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Libkin-Wong/94,
AUTHOR = {Libkin, Leonid and Wong, Limsoon},
TITLE = {Conservativity of nested relational calculi with internal generic functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {273-280},
YEAR = {1994},
KEYWORDS = {databases, relational calculus},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chepoi-Dragan/94,
AUTHOR = {Chepoi, Victor and Dragan, Feodor},
TITLE = {Computing a median point of a simple rectilinear polygon},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {281-285},
YEAR = {1994},
KEYWORDS = {computational geometry, median problem, rectilinear polygon, rectilinear distance},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Borchers-Gupta/94,
AUTHOR = {Borchers, Al and Gupta, Prosenjit},
TITLE = {Extending the quadrangle inequality to speed-up dynamic programming},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {287-290},
YEAR = {1994},
KEYWORDS = {analysis of algorithms, combinatorial problems, algorithms},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rajsbaum/94,
AUTHOR = {Rajsbaum, Sergio},
TITLE = {Upper and lower bounds for stochastic marked graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {291-295},
YEAR = {1994},
KEYWORDS = {stochastic marked graphs, Petri nets, distributed computing, performance evaluation},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Collin-Dolev/94,
AUTHOR = {Collin, Zeev and Dolev, Shlomi},
TITLE = {Self-stabilizing depth-first search},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {297-301},
YEAR = {1994},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sajith-Saxena/94,
AUTHOR = {Sajith, G. and Saxena, Sanjeev},
TITLE = {Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {303-308},
YEAR = {1994},
KEYWORDS = {algorithms, design of algorithms, parallel algorithms, graph coloring, optimal algorithm},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett.\ 54, 305},
}
@article{Kann/94,
AUTHOR = {Kann, Viggo},
TITLE = {Maximum bounded H-matching is Max SNP-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {309-318},
YEAR = {1994},
KEYWORDS = {approximation, combinatorial problems, computational complexity, MAX},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Reddy-Leiss/94,
AUTHOR = {Reddy, H.N. and Leiss, E.L.},
TITLE = {An $O(\log N)$ algorithm to solve linear recurrences on hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {319-325},
YEAR = {1994},
KEYWORDS = {algorithms, linear recurrences},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Prodinger/94,
AUTHOR = {Prodinger, Helmut},
TITLE = {An asymptotic comment on a paper by Analyti and Pramanik},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {49},
PAGES = {327-328},
YEAR = {1994},
KEYWORDS = {information retrieval, performance evaluation, Mellin transform},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}