@article{Di_Battista-Tamassia-Tollis/92,
AUTHOR = {Di Battista, Giuseppe and Tamassia, Roberto and Tollis, Ioannis G.},
TITLE = {Constrained visibility representations of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {1-7},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Jacob/92,
AUTHOR = {Jacob, Jeremy},
TITLE = {A model of reconfiguration in communicating sequential processes with a notion of transactions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {9-12},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ancona-Fassino-Gianuzzi/92,
AUTHOR = {Ancona, Massimo and Fassino, Claudia and Gianuzzi, Vittoria},
TITLE = {Optimization of LR($k$) ``reduced parsers''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {13-20},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Atkinson-Sack/92,
AUTHOR = {Atkinson, M.D. and Sack, J.-R.},
TITLE = {Generating binary trees at random},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {21-23},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Stotts-Godfrey/92,
AUTHOR = {Stotts, P. David and Godfrey, Parke},
TITLE = {Place/transition nets with debit arcs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {25-33},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Pachl/92,
AUTHOR = {Pachl, Jan},
TITLE = {A simple proof of a completeness result for leads-to in the UNITY logic},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {35-38},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett.\ 44, 171},
}
@article{Chen-Das/92,
AUTHOR = {Chen, Calvin C.-Y. and Das, Sajal K.},
TITLE = {Breadth-first traversal of trees and integer sorting in parallel},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {39-49},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Srimani-Reddy/92,
AUTHOR = {Srimani, Pradip K. and Reddy, Rachamallu L.N.},
TITLE = {Another distributed algorithm for multiple entries to a critical section},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {51-57},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kobuchi/92,
AUTHOR = {Kobuchi, Youichi},
TITLE = {Order of state functions and logic functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {61-66},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Pavlu/92,
AUTHOR = {Pavl{\r{u}}, Petr},
TITLE = {On efficient implementation of LR-attributed grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {67-75},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Adams/92,
AUTHOR = {Adams, Carlisle M.},
TITLE = {On immunity against Biham and Shamir's ``differential cryptanalysis''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {77-80},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{von_zur_Gathen/92,
AUTHOR = {von zur Gathen, Joachim},
TITLE = {Processor-efficient exponentiation in finite fields},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {81-86},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Leermakers/92a,
AUTHOR = {Leermakers, Ren{\'e}},
TITLE = {A recursive ascent Earley parser},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {87-91},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yao/92,
AUTHOR = {Yao, Xin},
TITLE = {Finding approximate solutions to NP-hard problems by neural networks is hard},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {93-98},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chang-Lee/92,
AUTHOR = {Chang, R.C. and Lee, H.S.},
TITLE = {Finding a maximum set of independent chords in a circle},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {99-102},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Aurenhammer-Stockl/92,
AUTHOR = {Aurenhammer, Franz and St{\"o}ckl, Gerd},
TITLE = {Searching for segments with largest relative overlap},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {103-108},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Huang-Chen/92,
AUTHOR = {Huang, Shing-Tsaan and Chen, Nian-Shing},
TITLE = {A self-stabilizing algorithm for constructing breadth-first trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {109-117},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gemignani/92,
AUTHOR = {Gemignani, Luca},
TITLE = {Fast inversion of Hankel and Toeplitz matrices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {119-123},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kirchherr/92,
AUTHOR = {Kirchherr, W.W.},
TITLE = {Kolmogorov complexity and random graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {125-130},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Misra-Gries/92,
AUTHOR = {Misra, J. and Gries, David},
TITLE = {A constructive proof of Vizing's theorem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {131-133},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Shermer/92,
AUTHOR = {Shermer, Thomas C.},
TITLE = {A linear algorithm for bisecting a polygon},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {135-140},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Esselink/92,
AUTHOR = {Esselink, Klaas},
TITLE = {The order of Appel's algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {141-147},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Aggarwal/92,
AUTHOR = {Aggarwal, Alok},
TITLE = {Parallel complexity of computing a maximal set of disjoint paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {149-151},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rajcani/92,
AUTHOR = {Raj{\v{c}}{\'a}ni, Peter},
TITLE = {Optimal parallel 3-coloring algorithm for rooted trees and its applications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {153-156},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Verma/92,
AUTHOR = {Verma, Rakesh M.},
TITLE = {Strings, trees, and patterns},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {157-161},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Larsen-Schwartzbach-Schmidt/92,
AUTHOR = {Larsen, Kim S. and Schwartzbach, Michael I. and Schmidt, Erik M.},
TITLE = {A new formalism for relational algebra},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {163-168},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wada-Luo-Kawaguchi/92,
AUTHOR = {Wada, Koichi and Luo, Yupin and Kawaguchi, Kimio},
TITLE = {Optimal fault-tolerant routings for connected graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {169-174},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Szalas/92,
AUTHOR = {Szalas, Andrzej},
TITLE = {Axiomatizing fixpoint logics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {175-180},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gusfield-Landau-Schieber/92,
AUTHOR = {Gusfield, Dan and Landau, Gad M. and Schieber, Baruch},
TITLE = {An efficient algorithm for the all pairs suffix-prefix problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {181-185},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wu-Tang/92,
AUTHOR = {Wu, L.C. and Tang, C.Y.},
TITLE = {Solving the satisfiability problem by using randomized approach},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {187-190},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rote-Woeginger/92,
AUTHOR = {Rote, G{\"u}nther and Woeginger, Gerhard},
TITLE = {Counting convex $k$-gons in planar point sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {191-194},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kamin/92,
AUTHOR = {Kamin, Samuel},
TITLE = {Head-strictness is not a monotonic abstract property},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {195-198},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Buss/92,
AUTHOR = {Buss, Samuel R.},
TITLE = {The graph of multiplication is equivalent to counting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {199-201},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Radhakrishnan/92,
AUTHOR = {Radhakrishnan, Jaikumar},
TITLE = {Improved bounds for covering complete uniform hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {203-207},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hoover-Poole/92,
AUTHOR = {Hoover, Debra and Poole, Joseph},
TITLE = {A distributed self-stabilizing solution to the dining philosophers problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {209-213},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Arvind-Pandu_Rangan/92,
AUTHOR = {Arvind, K. and Pandu Rangan, C.},
TITLE = {Connected domination and Steiner set on weighted permutation graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {215-220},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Goldmann-Hastad/92,
AUTHOR = {Goldmann, Mikael and H{\aa}stad, Johan},
TITLE = {A simple lower bound for monotone clique using a communication game},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {221-226},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ma-Narahari-Tao/92,
AUTHOR = {Ma, Eva and Narahari, Bhagirath and Tao, Lixin},
TITLE = {Optimal embedding of 2-D torus into ring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {227-231},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Shoudai/92,
AUTHOR = {Shoudai, Takayoshi},
TITLE = {A $\P$-complete language describable with iterated shuffle},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {233-238},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Whaley/92,
AUTHOR = {Whaley, Tom},
TITLE = {Alternative developments of cyclic-permutation algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {239-241},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wang/92b,
AUTHOR = {Wang, Guorong},
TITLE = {An improved parallel algorithm for computing the generalized inverse $A^+$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {243-251},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rivin-Zabih/92,
AUTHOR = {Rivin, Igor and Zabih, Ramin},
TITLE = {A dynamic programming solution to the $n$-queens problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {253-256},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Narayanaswami-Franklin/92a,
AUTHOR = {Narayanaswami, Chandrasekhar and Franklin, William Randolph},
TITLE = {Edge intersection on the hypercube computer},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {257-262},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ko-Ruskey/92,
AUTHOR = {Ko, Chun Wa and Ruskey, Frank},
TITLE = {Generating permutations of a bag by interchanges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {263-269},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Urrutia-Gavril/92,
AUTHOR = {Urrutia, J. and Gavril, F.},
TITLE = {An algorithm for fraternal orientation of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {271-274},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Blazewicz-DellOlmo-Drozdowski-Speranza/92,
AUTHOR = {B{\l}a{\.z}ewicz, J. and Dell'Olmo, P. and Drozdowski, M. and Speranza, M.G.},
TITLE = {Scheduling multiprocessor tasks on three dedicated processors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {275-280},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Inf.~Process.~Lett.\ 49, 269-270},
}
@article{Dam/92,
AUTHOR = {Dam, Mads},
TITLE = {$R$-generability, and definability in branching time logics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {281-287},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Clausen/92,
AUTHOR = {Clausen, Michael},
TITLE = {Almost all boolean functions have no linear symmetries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {291-292},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Muller/92,
AUTHOR = {M{\"u}ller, Fritz},
TITLE = {Confluence of the lambda calculus with left-linear algebraic rewriting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {293-299},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Erbas-Tanik-Aliyazicioglu/92,
AUTHOR = {Erbas, Cengiz and Tanik, Murat M. and Aliyazicioglu, Zekeriya},
TITLE = {Linear congruence equations for the solutions of the $N$-queens problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {301-306},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Miller/92a,
AUTHOR = {Miller, L.L.},
TITLE = {Generating hinges from arbitrary subhypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {307-312},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Esparza/92,
AUTHOR = {Esparza, Javier},
TITLE = {A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {313-319},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bshouty/92,
AUTHOR = {Bshouty, Nader H.},
TITLE = {A lower bound for the multiplication of polynomials modulo a polynomial},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {321-326},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lozinskii/92,
AUTHOR = {Lozinskii, Eliezer L.},
TITLE = {Counting propositional models},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {327-332},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Jansen/92a,
AUTHOR = {Jansen, Klaus},
TITLE = {An approximation algorithm for the general routing problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {333-339},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Carson-Nirkhe-Vongsathorn/92,
AUTHOR = {Carson, S.D. and Nirkhe, V. and Vongsathorn, P.},
TITLE = {A discrete-state model of the two-headed disk},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {41},
PAGES = {341-345},
YEAR = {1992},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}