4891<>328_7<>daniel s. hirschberg<>upper and lower bounds for graph-diameter problems with application to record allocation<>jct<>c. k. wong<>
4904<>331_5<>james r. bitner<>optimal and near-optimal scheduling algorithms for batched processing in linear storage<>siamcomp<>c. k. wong<>
5480<>818_16<>stanley c. kwasny:b. chandrasekaran:norman k. sondheimer<>an experimental graphics system with natural language input<>cg<>david c. brown<>
30731<>966_0<>nulo<>solution of the hamiltonian problem for self-complementary graphs<>jct<>siddani bhaskara rao<>
4860<>1342_0<>henry h. glover:john philip huneke<>103 graphs that are irreducible for the projective plane<>jct<>chin san wang<>
16145<>1441_19<>nulo<>data flow analysis of communicating processes<>popl<>john h. reif<>
16191<>1441_65<>nulo<>universal games of incomplete information<>stoc<>john h. reif<>
13163<>1465_42<>a. r. hinds<>unrolling loops in fortran<>spe<>jack dongarra<>
40574<>1471_8<>sunil r. das:c. l. sheng:w. j. hsu<>transition matrices in the measurement and control of synchronous sequential machines<>isci<>zen chen<>
8825<>1796_19<>nulo<>"graph isomorphism, general remarks."<>jcss<>gary l. miller<>
9232<>1961_53<>ramez elmasri<>data model integration using the structural model<>sigmod<>gio wiederhold<>
7065<>2344_0<>ira m. gessel<>depth-first search as a combinatorial correspondence<>jct<>da-lun wang<>
12779<>2394_3<>nulo<>computer-aided micro-analysis of programs<>icse<>jacques cohen<>
12799<>2394_23<>robin sitver<>a case study in program transformation: translation into polish<>tse<>jacques cohen<>
12801<>2394_25<>nulo<>non-deterministic algorithms<>csur<>jacques cohen<>
12812<>2394_36<>robin sitver:david auty<>evaluating and improving recursive descent parsers<>tse<>jacques cohen<>
12813<>2394_37<>timothy j. hickey<>two algorithms for determining volumes of convex polyhedra<>jacm<>jacques cohen<>
30976<>2683_8<>nulo<>hanf number of omitting type for simple first-order theories<>jsyml<>saharon shelah<>
31084<>2683_116<>martin ziegler 0002<>algebraically closed groups of large cardinality<>jsyml<>saharon shelah<>
3068<>2708_3<>h. h. teh<>constructions of point-colour-symmetric graphs<>jct<>c. c. chen<>
8888<>2734_4<>nulo<>on the generative capacity of conditional grammars<>iandc<>gheorghe paun<>
8895<>2734_11<>nulo<>some further remarks on the family of finite index matrix languages<>ita<>gheorghe paun<>
8928<>2734_44<>nulo<>on szilard's languages associated to a matrix grammar<>ipl<>gheorghe paun<>
8963<>2734_79<>nulo<>on the family of finite index matrix languages<>jcss<>gheorghe paun<>
8984<>2734_100<>nulo<>on the generative capacity of some classes of grammars with regulated rewriting<>mfcs<>gheorghe paun<>
7246<>2749_15<>hermann a. maurer:arto salomaa<>context-dependent l forms<>iandc<>derick wood<>
7248<>2749_17<>hermann a. maurer:martti penttonen:arto salomaa<>on non context-free grammar forms<>mst<>derick wood<>
4916<>2852_3<>tse-yun feng:dharma p. agrawal<>a microprocessor-controlled asynchronous circuit switching network<>isca<>chuan-lin wu<>
21878<>2856_4<>nulo<>translator design to support run-time debugging<>spe<>mark scott johnson<>
19519<>3044_0<>anita k. jones<>task forces: distributed software for solving problems of substantial size<>icse<>karsten schwan<>
5380<>3189_4<>nulo<>high-speed arithmetic arrays<>tc<>dharma p. agrawal<>
4344<>3195_25<>nulo<>the serializability of concurrent database updates<>jacm<>christos h. papadimitriou<>
9025<>3580_5<>andrzej ehrenfeucht<>an observation on scattered grammars<>ipl<>grzegorz rozenberg<>
8274<>3772_13<>david e. muller<>finding the intersection of n half-spaces in time o(n log n)<>tcs<>franco p. preparata<>
8280<>3772_19<>d. t. lee<>an optimal algorithm for finding the kernel of a polygon<>jacm<>franco p. preparata<>
8286<>3772_25<>nulo<>a note on locating a set of points in a planar subdivision<>siamcomp<>franco p. preparata<>
8329<>3772_68<>nulo<>an optimal real-time algorithm for planar convex hulls<>cacm<>franco p. preparata<>
13298<>3841_2<>grzegorz rozenberg<>equality languages and fixed point languages<>iandc<>joost engelfriet<>
27020<>4105_9<>nulo<>a patching algorithm for the nonsymmetric traveling-salesman problem<>siamcomp<>richard m. karp<>
27039<>4105_28<>romas aleliunas:richard j. lipton:laszla lovasz:charles rackoff<>"random walks, universal traversal sequences, and the complexity of maze problems"<>focs<>richard m. karp<>
11049<>4566_72<>nulo<>deep and shallow binding: the assignment operation<>cl<>hanan samet<>
34139<>4618_0<>nulo<>relational database systems<>csur<>won kim<>
17486<>4714_19<>j. kent peacock:eric g. manning<>distributed simulation using a network of processors<>cn<>j. w. wong<>
10789<>5068_1<>nulo<>new aspects of homomorphisms<>tcs<>hermann a. maurer<>
10798<>5068_10<>arto salomaa:derick wood<>context-dependent l forms<>iandc<>hermann a. maurer<>
10815<>5068_27<>maurice nivat<>bijective a-transducers<>focs<>hermann a. maurer<>
10821<>5068_33<>karel culik ii<>secure information storage and retrieval using new results in cryptography<>ipl<>hermann a. maurer<>
10827<>5068_39<>karel culik ii<>on simple representations of language families<>ita<>hermann a. maurer<>
10832<>5068_44<>jon louis bentley<>a note on euclidean near neighbor searching in the plane<>ipl<>hermann a. maurer<>
10836<>5068_48<>martti penttonen:arto salomaa:derick wood<>on non context-free grammar forms<>mst<>hermann a. maurer<>
24951<>5073_21<>eitan m. gurari<>some decision problems concerning sequential transducers and checking automata<>jcss<>oscar h. ibarra<>
24954<>5073_24<>eitan m. gurari<>on the space complexity of recursive algorithms<>ipl<>oscar h. ibarra<>
24980<>5073_50<>eitan m. gurari<>simple counter machines and number-theoretic problems<>jcss<>oscar h. ibarra<>
24986<>5073_56<>nulo<>restricted one-counter machines with undecidable universe problems<>mst<>oscar h. ibarra<>
25022<>5073_92<>eitan m. gurari<>an np-complete number-theoretic problem<>jacm<>oscar h. ibarra<>
24686<>5359_64<>michael j. fischer<>on describing the behavior and implementation of distributed systems<>scc<>nancy a. lynch<>
24721<>5359_99<>edward k. blum<>a difference in expressive power between flowcharts and recursion schemes<>mst<>nancy a. lynch<>
24736<>5359_114<>allan borodin:michael j. fischer:david g. kirkpatrick:martin tompa<>a time-space tradeoff for sorting on non-oblivious machines<>focs<>nancy a. lynch<>
7948<>6287_6<>jack h. van lint<>ovals in projective designs<>jct<>e. f. assmus jr.<>
1614<>6370_32<>nulo<>an analytic and experimental study of multiple channel controllers<>tc<>alan jay smith<>
18926<>6373_4<>clement t. yu:m. k. siu:z. meral ozsoyoglu<>performance analysis of three related assignment problems<>sigmod<>k. lam<>
1476<>6481_14<>hermann a. maurer:derick wood<>context-dependent l forms<>iandc<>arto salomaa<>
1479<>6481_17<>hermann a. maurer:martti penttonen:derick wood<>on non context-free grammar forms<>mst<>arto salomaa<>
1362<>6584_76<>nulo<>the temporal semantics of concurrent programs<>scc<>amir pnueli<>
1382<>6584_96<>zohar manna<>the modal logic of programs<>icalp<>amir pnueli<>
19774<>6645_14<>yahiko kambayashi:shuzo yajima<>organization of quasi-consecutive retrieval files<>is<>katsumi tanaka<>
3683<>6675_19<>nulo<>models of programming language concepts<>ac<>cliff b. jones<>
32525<>6765_1<>eiichi bannai<>on the spectra of certain distance-regular graphs<>jct<>tatsuro ito<>
