@article{Hassin/81,
AUTHOR = {Hassin, R.},
TITLE = {Maximum flow in (s,t) planar networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {107},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Statistics, Tel-Aviv Univ., Tel-Aviv, Israel},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Romani/81,
AUTHOR = {Romani, Francesco},
TITLE = {Author's reply to S. Moran's note on the shortest path problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {87},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Moran's note in Inf.~Process.~Lett. 13, 85-86},
}
@article{Watanabe/81,
AUTHOR = {Watanabe, Osamu},
TITLE = {A fast algorithm for finding all shortest paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {1-3},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lewis-Boynton-Burton/81,
AUTHOR = {Lewis, G.N. and Boynton, N.J. and Burton, F.W.},
TITLE = {Expected complexity of fast search with uniformly distributed data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {4-7},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math. and Computer Sci., Michigan Technol. Univ., Houghton, MI, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Storer/81,
AUTHOR = {Storer, J.A.},
TITLE = {Constructing full spanning trees for cubic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {8-11},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Bell Labs., Murray Hill, NJ, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ibarra-Moran/81,
AUTHOR = {Ibarra, O.H. and Moran, S.},
TITLE = {Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {12-15},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Univ.of Minnesota, Minneapolis, MN, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Korsh/81,
AUTHOR = {Korsh, J.F.},
TITLE = {Greedy binary search trees are nearly optimal},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {16-19},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {School of Business Administration, Temple Univ., Philadelphia, PA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Agrawala-Tripathi/81,
AUTHOR = {Agrawala, A.K. and Tripathi, S.K.},
TITLE = {On the optimality of semidynamic routing schemes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {20-22},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ramamohanarao-Sacks-Davis/81,
AUTHOR = {Ramamohanarao, K. and Sacks-Davis, R.},
TITLE = {Hardware address translation for machines with a large virtual memory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {23-29},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Univ. of Melbourne, Parkville, Victoria, Australia},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Senizergues/81,
AUTHOR = {Senizergues, G.},
TITLE = {A new class of C.F.L. for which the equivalence is decidable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {30-34},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Gunn-Harland/81,
AUTHOR = {Gunn, H.I.E. and Harland, D.M.},
TITLE = {Degrees of constancy in programming languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {35-38},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computational Sci., Univ. of St. Andrews, Fife, Scotland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Stoyan-Smelyakov/81,
AUTHOR = {Stoyan, Yu.G. and Smelyakov, S.V.},
TITLE = {An approach to the problems of routing optimization in the regions of intricate shape},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {1},
PAGES = {39-43},
YEAR = {1981, October},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Machine-Building Problems, Acad. of Sci., Kharkov, Ukrainian SSR},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Clerbout-Latteux/81,
AUTHOR = {Clerbout, M. and Latteux, M.},
TITLE = {The inclusion of d0l in multi-reset},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {45-47},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Makarov/81,
AUTHOR = {Makarov, O.M.},
TITLE = {Using duality for the synthesis of an optimal algorithm involving matrix multiplication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {48-49},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Biology of The South Seas, Sevastopol, USSR},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hood-Melville/81,
AUTHOR = {Hood, R. and Melville, R.},
TITLE = {Real-time queue operations in pure LISP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {50-54},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Atallah-Kosaraju/81,
AUTHOR = {Atallah, M.J. and Kosaraju, S.R.},
TITLE = {An adversary-based lower bound for sorting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {55-57},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Electrical Engng., Johns Hopkins Univ., Baltimore, MD, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rytter/81b,
AUTHOR = {Rytter, W.},
TITLE = {The dynamic simulation of recursive and stack manipulating programs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {58-63},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Informatics, Warsaw Univ., Warsaw, Poland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Regnier/81,
AUTHOR = {Regnier, M.},
TITLE = {On the average height of trees in digital search and dynamic hashing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {64-66},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Silva_Filho/81,
AUTHOR = {Silva Filho, Y.V.},
TITLE = {Optimal choice of discriminators in a balanced $k$-$d$ binary search tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {67-70},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Nucleo de Computacao Eletronica, Univ. Federal do Rio de Janeiro, Rio de Janeiro, Brazil},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Pan/81d,
AUTHOR = {Pan, V.Ya.},
TITLE = {The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {71-72},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Advanced Study, Princeton, NJ, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Book/81,
AUTHOR = {Book, R.V.},
TITLE = {Nts grammars and church-Rosser systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {73-76},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math., Univ. of California, Santa Barbara, CA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Vitter/81a,
AUTHOR = {Vitter, Jeffrey Scott},
TITLE = {A shared-memory scheme for coalesced hashing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {77-79},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Nakamura/81,
AUTHOR = {Nakamura, A.},
TITLE = {Some remarks on one-pebble rectangular array acceptors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {80-84},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Appl. Math., Hiroshima Univ., Hiroshima, Japan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Moran/81,
AUTHOR = {Moran, S.},
TITLE = {A note on 'is shortest path problem not harder than matrix multiplication?'},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {2},
PAGES = {85-86},
YEAR = {1981, November},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Technion, Haifa, Israel},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ibarra-Rosier/81,
AUTHOR = {Ibarra, O.H. and Rosier, L.E.},
TITLE = {On the decidability of equivalence for deterministic pushdown transducers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {89-93},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Univ. of Minnesota, Minneapolis, MN, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yamasaki/81,
AUTHOR = {Yamasaki, Hideki},
TITLE = {On weak persistency of Petri nets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {94-97},
YEAR = {1981, December},
KEYWORDS = {persistent Petri nets, reachability sets, semilinear sets},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Information Sci., Tokyo Inst. of Technol., Oh-Okayama, Meguroku, Tokyo, Japan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chan/81a,
AUTHOR = {Chan, Tat-Hung},
TITLE = {Deciding freeness for program schemes with a single unary function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {98-102},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Univ. of Minnesota, Minneapolis, MN, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Barlow-Evans-Shanehichi/81,
AUTHOR = {Barlow, R.H. and Evans, D.J. and Shanehichi, J.},
TITLE = {A parallel merging algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {103-106},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Studies, Loughborough Univ. of Technol., Loughborough, England},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ehrenfeucht-Rozenberg/81a,
AUTHOR = {Ehrenfeucht, A. and Rozenberg, G.},
TITLE = {On the subword complexity of d0l languages with a constant distribution},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {108-113},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bird/81,
AUTHOR = {Bird, R.S.},
TITLE = {The jogger's problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {114-117},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Univ. of Reading, Reading, England},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Atkinson/81,
AUTHOR = {Atkinson, M.D.},
TITLE = {The cyclic towers of Hanoi},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {118-119},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math. and Statistics, Carleton Univ., Ottawa, Canada},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Macdavid_Tolle-Siddall/81,
AUTHOR = {Macdavid Tolle, D. and Siddall, W.E.},
TITLE = {On the complexity of vector computations in binary tree machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {120-124},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Univ. of North Carolina, Chapel Hill, NC, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Denning-Meijer-Schneider/81,
AUTHOR = {Denning, D.E. and Meijer, H. and Schneider, F.B.},
TITLE = {More on master keys for group sharing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {125-126},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Computer Sci. Dept., Purdue Univ., West Lafayette, IN, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{van_de_Snepscheut/81,
AUTHOR = {van de Snepscheut, J.L.A.},
TITLE = {Synchronous communication between asynchronous components},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {3},
PAGES = {127-130},
YEAR = {1981, December},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Math., Eindhoven Univ. of Technol., Eindhoven, Netherlands},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Papadimitriou-Yannakakis/81b,
AUTHOR = {Papadimitriou, C.H. and Yannakakis, M.},
TITLE = {The clique problem for planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {131-133},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Lab. for Computer Sci., MIT, Cambridge, MA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Barth/81,
AUTHOR = {Barth, G.},
TITLE = {An alternative for the implementation of the Knuth-Morris-Pratt algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {134-137},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Computer Sci. Dept., Pennsylvania State Univ., University Park, PA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Davis-Rinaldi-Trebilcock/81,
AUTHOR = {Davis, R.H. and Rinaldi, C. and Trebilcock, C.J.},
TITLE = {Data compression in limited capacity microcomputer systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {138-141},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, Scotland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rytter/81a,
AUTHOR = {Rytter, W.},
TITLE = {Time complexity of languages recognized by one-way multihead pushdown automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {142-144},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Informatics, Warsaw Univ., Warzawa, Poland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rytter/81,
AUTHOR = {Rytter, W.},
TITLE = {A hardest language recognized by two-way nondeterministic pushdown automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {145-146},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. of Informatics, Warsaw Univ., Warszawa, Poland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sabelfeld/81,
AUTHOR = {Sabelfeld, V.K.},
TITLE = {Tree equivalence of linear recursive schemata is polynomial-time decidable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {147-153},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Computing Center, Novosibirsk, USSR},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Goodman-Shmueli/81,
AUTHOR = {Goodman, Nathan and Shmueli, Oded},
TITLE = {Limitations of the chase},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {154-156},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bertossi/81,
AUTHOR = {Bertossi, A.},
TITLE = {The edge Hamiltonian path problem is $NP$-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {157-159},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Italsiel Spa, Roma, Italy},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Siklossy/81,
AUTHOR = {Sikl{\'o}ssy, L.},
TITLE = {Efficient query evaluation in relational data bases with missing values},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {160-163},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Bell Labs., Naperville, IL, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Blum-Karp-Vornberger-Papadimitriou-Yannakakis/81,
AUTHOR = {Blum, M. and Karp, R.M. and Vornberger, O. and Papadimitriou, C.H. and Yannakakis, M.},
TITLE = {The complexity of testing whether a graph is a superconcentrator},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {164-167},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Univ. of California, Berkeley, CA, USA},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Schwartz/81,
AUTHOR = {Schwartz, Jacob T.},
TITLE = {Finding the minimum distance between two convex polygons},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {168-170},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ancona-Gianuzzi/81,
AUTHOR = {Ancona, M. and Gianuzzi, V.},
TITLE = {A new method for implementing LR(k) tables},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {171-176},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. Per La Matematica Applicata, CNR, Genova, Italy},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Edelsbrunner-Maurer/81,
AUTHOR = {Edelsbrunner, H. and Maurer, H.A.},
TITLE = {On the intersection of orthogonal objects},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {177-181},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. Graz, Graz, Austria},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Nakamura-Aizawa/81a,
AUTHOR = {Nakamura, A. and Aizawa, K.},
TITLE = {Acceptors for isometric parallel context-free array languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {182-186},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Appl. Math., Hiroshima Univ., Hiroshima, Japan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Williams/81,
AUTHOR = {Williams, M.H.},
TITLE = {A systematic test for extended operator precedence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {187-190},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, Scotland},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Yasuura/81,
AUTHOR = {Yasuura, H.},
TITLE = {Width and depth of combinational logic circuits},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {191-194},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Information Sci., Kyoto Univ., Kyoto, Japan},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Freivalds/81,
AUTHOR = {Freivalds, R{\=u}si{\c{n}}{\u{s}}},
TITLE = {Projections of languages recognizable by probabilistic and alternating finite multitape automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {195-198},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Arora-Sharma/81,
AUTHOR = {Arora, P.K. and Sharma, N.K.},
TITLE = {Guarded procedure: a distributed programming concept},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {199-203},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Computer Centre, Indian Inst. of Technol., New Delhi, India},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Guida-Somalvico/81,
AUTHOR = {Guida, G. and Somalvico, M.},
TITLE = {Multi-problem-solving: knowledge representation and system architecture},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {204-214},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Istituto di Elettrotecnica Ed Elettronica, Politecnico di Milano, Milano, Italy},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Warren-Fox-Markstein/81,
AUTHOR = {Warren, Henry S., Jr. and Fox, A. Shawhan and Markstein, Peter W.},
TITLE = {Modulus division on a two's complement machine},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
PAGES = {215-217},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Troya-Vaquero/81,
AUTHOR = {Troya, J.M. and Vaquero, A.},
TITLE = {An approximation algorithm for reducing expected head movement in linear storage devices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {13},
NUMBER = {4-5},
PAGES = {218-220},
YEAR = {1981},
PUBLISHER = {North-Holland Publishing Company},
INSTITUTION = {Dept. of Informatica Y Automatica, Univ. Complutense, Madrid, Spain},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}