Most cited articles in Computer Science published in 1977 - generated in September 2006 (CiteSeer.Continuity)

Generated from documents in the CiteSeer.Continuity database. This list does not include citations where one or more authors of the citing and cited articles match. This list is automatically generated and may contain errors. The list is generated in batch mode and citation counts may differ from those currently in the CiteSeer.Continuity database, because the database is continuously updated.

All Years   1990   1991   1992   1993   1994   1995   1996   1997   1998   1999   2000   2001   2002   2003   2004   2005   2006  

1.   Doc     Context   2321   3. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society, Series B (Methodological) , 39(1):1--38, 1977.

2.   Doc     Context   823   [10] F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.

3.   Doc     Context   782   Cousot, P. and Cousot, R. 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages (POPL '77 ). ACM Press, New York, 238--252.

4.   Doc     Context   690   [5] A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99--118, 1977.

5.   Doc     Context   522   21. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46--57, 1977.

6.   Doc     Context   382   12. V.Ya.Tikhonov and A.N.Arsenin, Solution of ill-posed problems, Winston-Wiley, New York (1977).

7.   Doc     Context   377   [2] R. M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44--67, January 1977.

8.   Doc     Context   336   [5] D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6:323--50, 1977. 20 T. Kowaltowski, C. Lucchesi and J. Stolfi

9.   Book   Context   315   [16] D. Gilbarg and N. S. Trudinger, Elliptic Partial Differential Equations of Second Order, Springer-Verlag, 1977.

10.   Doc     Context   311   [42] Joseph Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.

11.   Doc     Context   290   [16] Gordon Plotkin. LCF considered as a programming language. Theoret. Comput. Sci., 5(3):223--256, December 1977.

12.   Doc     Context   252   [4] A. Brandt. Multi--level adaptive solutions to boundary--value problems. Math. Comp., 31:333-- 390, 1977.

13.   Doc     Context   236   [13] J. H. Friedman, J. L. Bentley, and R. A. Finkel, "An algorithm for finding best matches in logarithmic expected time," ACM Transactions on Mathematical Software, vol. 3, September 1977.

14.   Doc     Context   232   [ Chandra and Merlin, 1977 ] Ashok K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the 9th ACM Symposium on Theory of Computing, pages 77--90, 1977.

15.   Doc     Context   221   [22] Roy Goldman and Jennifer Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. Technical report, Stanford, 1977.

16.   Doc     Context   218   [14] M.S. Hecht. Flow Analysis of Computer Programs. North Holland, New York, 1977.

17.   Doc     Context   211   [4] Tate, A. Generating project networks. In procs. of the International Joint Conference on Artificial Intelligence, 1977.

18.   Doc     Context   198   [20] J. A. Meijerink and H. A. van der Vorst. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comp., 31:148--162, 1977.

19.   Doc     Context   196   [BM77] Boyer R. S., and J. S. Moore, "A fast string searching algorithm," Communications of the ACM 20 (October 1977), pp. 762-772.

20.   Doc     Context   195   Hewitt, C. 1977. Viewing control structures as patterns of passing messages. Artif. Intell. 8, 323--364.

21.   Doc     Context   187   [4] P. Cousot and R. Cousot. Abstract Interpretation: a Unied Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Fourth ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.

22.   Doc     Context   182   [Bel77] N Belnap. A useful four-valued logic. In G Epstein, editor, Modern Uses of Multiple-valued Logic, pages 8--37. Reidel, 1977.

23.   Book   Context   171   [14] John W. Tukey. Exploratory Data Analysis. Addison-Wesley, 1977.

24.   Book   Context   171   [5] P. Henrici, Applied and Computational Complex Analysis, Vol. II, John Wiley & Sons, New York (1977).

25.   Doc     Context   161   Bernstein, F. C., Koetzle, T. F., Williams, G. J. B., Meyer, E.J., Jr., Brice, M. D., Rodgets, J. R., Kennard, O. Shimamouchi, T., and Tasumi, M. 1977. The protein data bank: A computer based archival file for macromolecular structures. Journal of Molecular Biology.

26.   Doc     Context   156   [9] D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Commun. ACM, 20(7):504--513, 1977.

27.   Doc     Context   152   [4] W. G. Cochran. Sampling Techniques. John Wiley & Sons, 1977.

28.   Doc     Context   152   [18] R. Stallman and G. Sussman. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9:135--196, 1977.

29.   Doc     Context   150   [15] A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 17th Annual Symposium on Foundations of Computer Science, pages 222--227, 1977.

30.   Doc     Context   149   1. K. Appel and W. Haken. Every planar map is four colorable. part I. discharging. Illinois J. Math., 21:429-490, 1977.

31.   Doc     Context   131   [25] L. Lamport (1977): Proving the correctness of multiprocess programs. IEEE Trans. Software Engin. 3, pp. 125--143.

32.   Doc     Context   129   [51] R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6:467--480, 1977.

33.   Doc     Context   125   Dempster, A. P., Laird, N. M. and Rubin, D. B., Maximum Likelihood Estimation from Incomplete data via the EM Algorithm, Journal of the Royal Statistical Society, Series B, 39 (1977) 1-22.

34.   Doc     Context   124   [3] L. Berman and J. Hartmanis. On isomorphism and density of NP and other complete sets. SIAM Journal on Computing, 6(2):305322, 1977.

35.   Doc     Context   123   [9] Mackey, M., Glass, L., Oscillation and chaos in a physiological control system, Science 197, 287 (1977).

36.   Doc     Context   121   [6] H. C. Andrews and B. R. Hunt, Digital Image Restoration. Englewood Cliffs, New Jersey: Prentice Hall, 1977.

37.   Doc     Context   118   [3] K. J. Biba. Integrity considerations for secure computer systems. Technical Report MTR 3153, The Mitre Corporation, April 1977.

38.   Book   Context   116   7. R. Lyndon and P. Schupp (1977). Combinatorial group theory. Springer.

39.   Doc     Context   115   [2] H.-P. Schwefel. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Birkh¨auser, Basel, 1977.

40.   Doc     Context   115   [17] Tversky, A.: Features of similarity. Psychological Rev. 84(4) (Jul. 1977):327--352

41.   Doc     Context   114   [16] J.B. Kam and Jeffrey D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:305--317, 1977.

42.   Book   Context   107   [Se] J. P. Serre, Linear Representations of Finite Groups, GTM 42, Springer Verlag 1977

43.   Doc     Context   106   [Hals77] Halstead, M., Elements of Software Science, Elseview NorthHolland, 1977.

44.   Doc     Context   104   [8] Makanin, G.S., The problem of solvability of equations in a free semigroup, Mat. Sb., Vol. 103,(145), 147-233, 1977. English transl. in Math. U.S.S.R. Sb. Vol 32, 1977.

45.   Doc     Context   104   [110] Joseph Goguen, James Thatcher, Eric Wagner, and Jesse Wright. Initial algebra semantics and continuous algebras. Journal of the Association for Computing Machinery, 24(1):68--95, January 1977.

46.   Doc     Context   103   [6] G. Forsythe, M. Malcolm, and C. Moler. Computer Methods for Mathematical Computations. Prentice Hall, Inc., 1977.

47.   Doc     Context   102   [12] Vasicek, O. (1977)"An Equilibrium Characterization of the Term Structure. " Journal of Financial Economics 5:177-88. A Appendix 1 In this appendix, we calculate the normalization factor

48.   Doc     Context   102   [KM77] G. Kahn and D.B. MacQueen, Coroutines and networks of parallel processes, in: Proc. IFIP77, B. Gilchrist (ed.), North-Holland, pp.993-998, 1977.

49.   Doc     Context   100   [10] Schank Roger C. and Abelson Robert P., Scripts, Plans, Goals and Understanding. Lawrence Erlbaum Associates, Hillsdale, New Jersey, 1977.

50.   Doc     Context   98   Peterson, J. L. 1977. Petri nets. ACM Computing Surveys 9:223--252.

51.   Book   Context   97   In M. I. Jordan (Ed.), Learning in Graphical Models. MIT Press: Cambridge, MA. Dempster, A., Laird, N., and Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B 39: 1-38.

52.   Doc     Context   96   Aczel, P. 1977. An introduction to inductive definitions. In Handbook of Mathematical Logic, J. Barwise, Ed. North-Holland, Amsterdam, 739--782.

53.   Doc     Context   94   [2] J. Duchon. Splines minimizing rotation-invariant semi-norms in sobolev spaces. In A. Dodd and B. Eckmann, editors, Constructive Theory of Functions of Several Variables, pages 85--100. Berlin: Springer-Verlag, 1977.

54.   Doc     Context   94   25ZLOOF, M. M. 1977. Query-by-Example: A Database Language. IBM Syst.Journal, 16, 4,

55.   Doc     Context   93   [34] Stone, C. J. (1977) Consistent nonparametric regression. Ann. Statist., 5, 595-645. Figure Captions

56.   Doc     Context   92   [49] Liskov, B., Snyder, A., Atkinson, R., and Schaffert, C. Abstraction mechanisms in CLU. Communications of the ACM 20, 8 (1977), 564--576.

57.   Doc     Context   91   [16] J. K. Lenstra, A. H. G. Rinnooy Kan and P. Brucker, 1977. Complexity of Machine Scheduling Problems, Ann. Discrete Math. 1, 343--362.

58.   Doc     Context   90   [10] Burstall, R. M., and Goguen, J. A. Putting theories together to make specifications. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence (Cambridge, Mass., 1977), pp. 1045--1058.

59.   Doc     Context   90   25. Reingold, Edward M., Jurg Nievergelt and Narsingh Deo. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, Inc., 1977.

60.   Doc     Context   90   [11] P. A. Raviart and J. M. Thomas, A mixed finite element method for second order elliptic problems, in Mathematical Aspects of Finite Element Methods: Lecture Notes in Mathematics 606, I. Galligani and E. Magenes, eds., Berlin, 1977, Springer-Verlag, pp. 292--315.

61.   Doc     Context   88   [32] A. Papoulis. Signal analysis. McGraw-Hill, New York, 1977.

62.   Doc     Context   88   [36] H. S. Stone. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. on Software Engineering, SE-3(1):85--93, January 1977.

63.   Book   Context   87   Liptser, R.Sh. and Shiryaev, A.N. (1977): Statistics of Random Processes. Springer, New York.

64.   Doc     Context   86   [7] B. Engquist and A.Majada, Absorbing boundary condition for the numerical simulation of waves, Math. Comp., 31 (1977), pp. 629--651.

65.   Doc     Context   86   [31] M. J. O'Donnell. Computing in Systems Described by Equations. Springer LNCS 58, 1977.

66.   Doc     Context   85   [31] A. Mazurkiewicz. Concurrent program schemes and their interpretations. Research report DAIMI Rep. PB-78, Aarhus Univ., 1977.

67.   Doc     Context   84   [1] J. McCarthy. Epistemological problems of artificial intelligence. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, pages 1038--1044, Cambridge, MA, 1977.

68.   Doc     Context   81   [8] M. B. Pursley, "Performance evaluation for phase-coded spread-spectrum multiple-access communication-Part I: System analysis," IEEE Trans. Commun., Vol. COM-25, No. 8, pp. 795-799, Aug. 1977.

69.   Doc     Context   81   [2] Peter T. Johnstone. Topos Theory. Academic Press, 1977.

70.   Doc     Context   79   [25] D. W. Peaceman, Fundamentals of Numerical Reservoir Simulation, Elsevier, 1977.

71.   Doc     Context   79   12. C. Thompson and H. Kung. Sorting on a mesh-connected parallel computer. Communications of the ACM, 20(4):263--271, 1977. This article was processed using the L A T E X macro package with LLNCS style

72.   Doc     Context   77   [4] T. Pavlidis, Structural Pattern Recognition. New York: Springer Verlag, 1977.

73.   Book   Context   77   [15] Loeve, M., Probability Theory, 4 th edition, Springer-Verlag, New York, 1977.

74.   Doc     Context   77   [Bayer] R. Bayer and M. Schkolnick, "Concurrency of Operations on B-Trees," Acta Informatica, 9,1 (1977), 1-21.

75.   Doc     Context   76   [SmSm 77] Smith, John and Smith, Diane C.P.: "Database Abstractions: Aggregation and Generalization"; ACM TODS; vol.2 no.2. June 1977, pp.105--133.

76.   Doc     Context   76   [9] W. Chen, C. H. Smith and S. Fralic, "A fast computational algorithm for the discrete cosine transform", IEEE Trans. on Communication, Vol. 25, Sept. 1977, pp. 1004--1009.

77.   Doc     Context   76   [7] Persoon E, Fu K. Shape discrimination using Fourier descriptors. IEEE Trans Sys, Man, and Cyber 1977; 7(3):170-178

78.   Doc     Context   75   Schank, R., Abelson, R. (1977) Scripts, Plans, Goals, and Understanding. Hillsdale, NJ: Lawrence Erlbaum.

79.   Doc     Context   74   Narendra, M. P., and Fukunaga, K. 1977. A branch and bound algorithm for feature subset selection.

80.   Doc     Context   73   [ Amari, 1977 ] S.-I. Amari. Dynamics of pattern formation in lateral-inhibition type neural fields. Biological Cybernetics, 27:77--87, 1977.

81.   Doc     Context   73   [20] R. C. Moore, Reasoning about knowledge and action, Proc. of IJCAI77 , Cambridge, MA, 1977, 223-227.

82.   Doc     Context   73   [5] J. Barwise. On Moschovakis closure ordinals. Journal of Symbolic Logic, 42:292--296, 1977.

83.   Doc     Context   72   Grosz, B. J. 1977. The Representation and Use of Focus in Dialogue Understanding. Ph.D. thesis, Stanford University.

84.   Doc     Context   72   [B77] J. F. Blinn. Models of light reflection for computer synthesized pictures. Computer Graphics, 11(2):192--198, 1977.

85.   Doc     Context   71   [FKU77] H. Fuchs, Z. M. Kedem, and S. P. Uselton. Optimal surface reconstruction from planar contours. Commun. ACM, 20:693--702, 1977.

86.   Doc     Context   70   [Alexander, 1977] Alexander, C., Ishikawa, S., Silverstein, M., Jacobson, M., Fiksdahl-King, I., and Angel, S. (1977). A Pattern Language. Oxford University Press.

87.   Doc     Context   70   2. Patrick and Radhia Cousot: "Abstract Interpretation: a unified lattice model for static analysis of programs by construction of approximative fixpoints" in Proc. of the 4th ACM Symp. on POPL (1977) 238--252

88.   Doc     Context   68   [3] M. R. Garey and D. S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM Journal of Applied Mathematics, 32 (1977), pp. 826--834.

89.   Doc     Context   68   [10] S. E. Robertson. The probability ranking principle in IR. Journal of Documentation, 33(4):294-- 304, December 1977.

90.   Doc     Context   68   [7] Chaitin, G. J., Algorithmic information theory, IBM J. Res. Develop. 21, 1977, pp. 350--359, 496.

91.   Doc     Context   68   [20] R. Milner. Fully abstract models of typed lambda-calculi. Theoretical Computer Science, 4:1--22, 1977.

92.   Doc     Context   66   [8] Solovay, R., and Strassen, V., A fast Monte-Carlo test for primality, SIAM J. Comput. 6, 1977, pp. 84--85.

93.   Doc     Context   65   [1] Peter J. Bickel and Kjell A. Doksum. Mathematical Statistics: Basic Ideas and Selected Topics. Holden-Day, Inc, 1977. Section 9.6.

94.   Book   Context   65   [MKD77] W. Magnus, A. Karrass, and Solitar D. Combinatorial Group Theory. Berlin: Springer-Verlag, 1977.

95.   Doc     Context   65   [5] P.A. Raviart and J.M. Thomas. A mixed finite element method for 2nd order elliptic problems. Number 606, pages 292--315. Proc. of math. aspects on the finite element method, 1977.

96.   Doc     Context   65   [12] R. Milner. Fully abstract models of typed -calculi. Theoretical Computer Science, 4:1 -- 22, 1977.

97.   Doc     Context   64   [Cro77] F. Crow. Shadow Algorithms for Computer Graphics. Computer Graphics (ACM SIGGRAPH '77 Proceedings), 11(3):242--248, August 1977.

98.   Doc     Context   63   [18] H. P. Moravec,"Towards automatic visual obstacle avoidance," Proc. 5th Int. Conf. on Artificial Intell., Cambridge, MA, pp 584, 1977.

99.   Doc     Context   62   [16] L. STOCKMEYER, The polynomial-time hierarchy, Theoretical Comput. Sci., 3 (1977), pp. 1-22.

100.   Doc     Context   62   [3] M. Eigen and P. Schuster. The hypercycle A: A principle of natural self-organization: Emergence of the hypercycle. Naturwissenschaften, 64:541--565, 1977.

101.   Book   Context   62   [13] A. ISHIMARU, Wave propagation and scattering in random media, Academic Press, 1977.

102.   Doc     Context   61   [8] B.S. Garbow et al., Matrix eigensystem routines : EISPACK guide extension, (Berlin ; New York : Springer-Verlag, 1977).

103.   Doc     Context   61   [19] M. Hirsch, C. Pugh, M. Shub, "Invariant Manifolds", Lect. Notes Math. 583, Springer-Verlag, 1977.

104.   Doc     Context   60   Courtois, P.J. 1977. Decomposability: Queueing and Computer System Applications. Academic Press, New York.

105.   Doc     Context   60   [4] D. Kozen. Complexity of finitely presented algebras. In Proc. of the 9th Annual Symposium on Theory of Computing, pages 164--177, New York, 1977. ACM.

106.   Doc     Context   59   [Lju77] L. Ljung, "Analysis of Recursive Stochastic Algorithms," IEEE Trans. on Automatic Control, Vol. 22, pp. 551-575, 1977.

107.   Book   Context   59   [13] P. R. Gray and R. G. Meyer, Analysis and Design of Analog Integrated Circuits, pp. 717--718, J. Wiley & Sons, 1977.

108.   Doc     Context   58   [11] A. Borodin, On Relating Time and Space to Size and Depth, SIAM Journal of Computing, 6 (1977), pp. 733--744.

109.   Doc     Context   58   R. Shiffrin and W. Schneider, (1977). Controlled and automatic human information processing II.

110.   Doc     Context   58   [3] H.G. Barrow et al., "Parametric Correspondence and Chamfer Matching: two new techniques for image matching," Proc. IJCAI, vol.2, pp.659-663, 1977.

111.   Doc     Context   57   [Har77] W. Harrison. Compiler analysis of the value ranges of variables. IEEE Transactions on Software Engineering, 3(3):243--250, 1977.

112.   Doc     Context   56   [LL] L. D. Landau and E. M. Lifshitz, Quantum Mechanics (3 rd edition), Pergamon (1977).

113.   Doc     Context   56   [HS77] J. Hunt and T. Szymanski. A fast algorithm for computing longest common subsequences. Communications of the ACM, 20(5):350--353, 1977.

114.   Doc     Context   55   [8] P. van Emde Boas, R. Kaas, E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977) 99127.

115.   Doc     Context   55   [15] R. E. Bryant. Simulation of packet communication architecture computer systems. Technical Report MIT-LCS-TR-188, M.I.T., 1977.

116.   Doc     Context   55   1. J. R. Bunch and L. Kaufman, Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems, Math. Comp. 31, January 1977, pp. 163-179.

117.   Doc     Context   54   Lamport, L. 1977. Concurrent reading and writing. Commun. ACM 20, 11 (November), 806--811.

118.   Doc     Context   54   [17] D. S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of the ACM, 24(4):664--675, October 1977.

119.   Doc     Context   54   [20] J. J. Mor' e, The Levenberg-Marquardt algorithm: Implementation and theory, in Numerical Analysis, G. A. Watson, ed., vol. 630 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, Heidelberg, New York, 1977, ch. 105-116. 20 D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST

120.   Doc     Context   53   Ripley, B. D. (1977). Modelling spatial patterns (with discussion). Journal of the Royal Statistical Society, Series B, 39, 172--212.

121.   Doc     Context   53   [2] H. Imai and S. Hirakawa. A new multilevel coding method using error correcting codes. , vol.IT-23:pp.371--377, May 1977.

122.   Doc     Context   53   [13] D. Kozen, Lower bounds for natural proof systems, FOCS 1977,254-266.

123.   Doc     Context   52   [47] F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Commun. ACM, 20:87--93, 1977.

124.   Doc     Context   52   [8] Diestel, J., Uhl, J. J., Vector Measures, Math. Surveys, 15, AMS Providence, Rhode Island (1977).

125.   Doc     Context   51   J. Barwise, ed., 1977, Handbook of Mathematical Logic, North-Holland, Amsterdam.

126.   Doc     Context   51   [22] R. G. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Transactions on Communications, vol. COM-25, pp. 73--85, 1977.

127.   Doc     Context   50   25. E.L. Schwartz. Spatial mapping in the primate sensory projection : Analytic structure and relevance to perception. Biological Cybernetics, 25:181--194, 1977.

128.   Doc     Context   50   [Bishop, 1977] Peter B. Bishop. Computer Systems with a Very Large Address Space and Garbage Collection. PhD thesis, Massachusetts Institute of Technology Laboratory for Computer Science, May 1977. Technical report MIT/LCS/TR-178.

129.   Doc     Context   50   [8] Edwin H. Land. The retinex theory of color vision. (The) Scientific American, 12:108--128, December 1977.

130.   Doc     Context   50   [6] Jones, N. and Lasser, T., "Complete problems for deterministic polynomial time," Theor. Comput. Sci., vol. 3, pp. 105--117, 1977

131.   Doc     Context   49   [14] W. Diffie and M.E. Hellman. Exhaustive Cryptanalysis of the NBS Data Encryption Standard. IEEE Computer, 10(6):74--84, 1977.

132.   Doc     Context   49   Mitchell,T.M., 1977, Version Spaces: A Candidate Elimination Approach to Rule Learning, Proceedings Fifth International Joint Conference on Artificial Intelligence, Cambridge, Mass. pp 305-310.

133.   Doc     Context   48   [05] R. J. McEliece, "The Theory of Information and Coding," Addison Wesley, 1977.

134.   Doc     Context   48   [16] M. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, pages 595--629. North-Holland, 1977.

135.   Doc     Context   48   24. K. Schoman and D. Ross. Structured Analysis for requirements definition, IEEE Trans. on Software Engineering, 3(1), 1977.

136.   Doc     Context   48   [3] C. Alexander. A Pattern Language: Towns, Buildings, Construction. Oxford University Press, New York, 1977. 10

137.   Doc     Context   48   [3] G. J. Bierman, Factorization methods for discrete sequential estimation, New York : Academic Press (1977).

138.   Doc     Context   48   [36] S.B. Yao. Approximating Block Accesses in Database Organizations. Communications of ACM, 20(4):260--261, 1977.

139.   Doc     Context   48   [13] M. R. Garey, R. L. Graham, and D. S. Johnson. The complexity of computing Steiner minimal trees. SIAM J. Appl. Math., 32:835--859, 1977.

140.   Doc     Context   47   Kydland, F.E. and Prescott, E. (1977). `Rules Rather than Discretion: The Inconsistency of Optimal Plans'. Journal of Political Economy, 85: 473--491.

141.   Doc     Context   47   [7] C. S. Peskin. Numerical analysis of blood flow in the heart. Journal of Computational Physics, 25:220-- 252, 1977.

142.   Doc     Context   47   [32] R. M. Karp, "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane", Mathematics of Operations Research, Vol. 2, No. 3, pp. 209-224, 1977.

143.   Doc     Context   46   [17] N. L. Johnson and S. Kotz. Urn Models and Their Application. John Wiley & Sons, 1977.

144.   Doc     Context   46   [Mak77] A. Makinouchi, A consideration of normal form of not-necessarily-normalized relations in the relational data model, Proc. of Intl. Conf. on Very Large Data Bases, 1977, pp. 447--453.

145.   Doc     Context   46   [36] D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis, "An analysis of several heuristics for the traveling salesman problem," SIAM Journal on Computing , vol. 6, pp. 563--581, 1977.

146.   Doc     Context   46   [BEMA77] Bell, J., Machover, M., A Course in Mathematical Logic, North Holland, 1977.

147.   Doc     Context   46   [2] Phillip D. Summers, "A methodology for lisp program construction from examples", Journal of the ACM, vol. 24, no. 1, pp. 161--175, Jan. 1977.

148.   Doc     Context   45   [9] R. J. McEliece, E. R. Rodemich, H. Rumsey and L. R. Welch. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Transactions on Information Theory 23 (1977), 157--166.

149.   Doc     Context   45   [LS] B. F. Logan and L. A. Shepp, A variational problem for random Young tableaux, Adv. Math. 26 (1977), 206--222.

150.   Doc     Context   45   [15] J. Cocke and K. Kennedy. An algorithm for reduction of operator strength. Communications of the ACM, 20(11):850--856, November 1977.

151.   Doc     Context   45   [14] L. Kleinrock and F. Kamoun. Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks, 1977.

152.   Doc     Context   44   [7] P. Ekman and W. Friesen. Facial Action Coding System. Consulting Psychologists, Palo Alto, CA, 1977.

153.   Doc     Context   44   [35] D.H.D. Warren. -- Implementing Prolog - compiling predicate logic programs. -- Research Report 39 and 40, University of Edinburgh, Department of Artificial Intelligence, 1977.

154.   Doc     Context   44   [H] Hale, J. K., Theory of Functional Differential Equations, Springer-Verlag, New York-Heidelberg-Berlin (1977).

155.   Doc     Context   44   [38] L. Csanky. Fast parallel matrix inversion algorithms. SIAM J. Comput., 5:618--623, 1977.

156.   Book   Context   43   7. W. F. Ames, Numerical Methods for Partial Differential Equations, 2 nd edition, Academic Press, New York, 1977.

157.   Doc     Context   43   [17] C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science, 3:23--33, 1977.

158.   Doc     Context   43   Feldman, Jerome A. and Sproull, Robert F. 1977. Decision Theory and Artificial Intelligence II: The hungry monkey. Cognitive Science 1:158--192.

159.   Book   Context   43   [11] Lindenstrauss, J. and L. Tzafriri, Classical Banach Spaces I , Springer, 1977.

160.   Doc     Context   43   [116] John Guttag. Abstract data types and the development of data structures. Communications of the Association for Computing Machinery, 20:297--404, June 1977.

161.   Doc     Context   43   [5] S. S. Panwalkar, W. Iskander (1977). A survey of scheduling rules. Operations Research, Vol. 25, No.1, 45-60

162.   Doc     Context   43   [Sho77] R.E. Shostak. On the SUP-INF method for proving Presburger formulas. J. ACM, 24(4):529--543, 1977.

163.   Doc     Context   43   [FI46-77] FIPS 46, "Data Encryption Standard," National Bureau of Standards, 1977.

164.   Doc     Context   42   [Ham77] R. G. Hamlet. Testing programs with the aid of a compiler. IEEE Transactions on Software Engineering, 3(4), July 1977.

165.   Doc     Context   42   Nevatia, R., and Binford, T. O. 1977. Description and recognition of curved objects. Artificial Intelligence 8(1):77--98.

166.   Doc     Context   42   [53] R. Lorie. Physical integrity in a large segmented database. ACM Transactions on Database Systems, 2(1):91--104, March 1977.

167.   Doc     Context   42   [39] T.A. Manteuffel, The Tchebychev iteration for nonsymmetric linear systems, Numer. Math. 28 (1977), pp. 307--327.

168.   Doc     Context   42   [CC77] P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: Mathematical foundations. In ACM Symposium on Artificial Intelligence and Programming Languages, 1977.

169.   Doc     Context   42   [10] M. R. Garey and D. S. Johnson. Two-processor scheduling with start-times and deadlines. SIAM J. Comput., 6:416--426, 1977.

170.   Doc     Context   42   3. Edmonds J. and Giles R., A min-max relation for submodular functions on graphs, Studies in Integer Programming (P. L. Hammer, E. L. Johnson and B. H. Korte, eds.), Ann. Discrete Math. Vol. 1, North-Holland, Amsterdam, 1977, pp. 185--204.

171.   Doc     Context   42   [20] Schmidt, J.W., "Some High Level Language Constructs for Data of Type Relation", ACM Transactions on Database Systems, 2(3):247-261, 1977.

172.   Doc     Context   41   Hubel, D.H., & Wiesel, T.N. 1977. Functional architecture of the macaque monkey visual cortex. Proceedings of the Royal Society, London [B], 198, 1--59.

173.   Doc     Context   41   [10] P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6 (1977), pp. 80--82.

174.   Doc     Context   40   [17] L. Valiant. Graph-theoretic arguments in low-level complexity. In 6th Mathematical Foundations of Computer Science, Vol. 197 of Lecture Notes in Computer Science, pp. 162--176. Springer-Verlag, 1977.

175.   Doc     Context   40   [22] David B. Loveman. Program Improvement by Source-to-Source Transformation. Journal of the ACM, 24(1):121--145, January 1977.

176.   Book   Context   40   [1] Thomas J. Allen. Managing the Flow of Technology. Cambridge MA: MIT Press, 1977.

177.   Doc     Context   40   Mosteller, F. and Tukey, J.W. (1977), Data Analysis and Regression, Reading, Mass.: Addison--Wesley.

178.   Doc     Context   40   [8] Data Encryption Standard. (U.S.) National Bureau of Standards, January 1977. (U.S.) Federal Information Processing Standards Publication, FIPS PUB 46.

179.   Doc     Context   39   Granger, R.H. (1977), "Foul-Up: A Program that Figures Out Meanings of Words from Context," IJCAI-77: 67--68.

180.   Doc     Context   39   [12] S. A. Dudani, K. J. Breeding, and R. B. McGhee, "Aircraft identification by moment invariants, " IEEE Transactions on Computers, vol. C-26, pp. 39--45, January 1977.

181.   Doc     Context   39   [30] W. Winston. Optimality of the shortest line discipline. Journal of Applied Probability, 14:181--189, 1977.

182.   Doc     Context   39   [SI77] N. Suzuki and K. Ishihata. Implementation of array bound checker. In Proc. ACM Symposium on Principles of Programming Languages, pages 132--143, 1977.

183.   Doc     Context   39   [GS77] P. Green and R. Sibson. Computing dirichlet tessellations in the plane. Computing Journal, 21:168--173, 1977.

184.   Doc     Context   38   [Bach77] Bachman C. W., Daya M.: "The Role Concept in Data Models", International Conference on Very Large Databases, 1977, pp. 464 - 476.

185.   Doc     Context   38   [8] A.I. Markushevich, Theory of Functions of a Complex Variable, Chelsea Publishing Company, 1977.

186.   Doc     Context   38   [4] J. Green and J.J. Laffont. Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica, pages 427--438, 1977.

187.   Doc     Context   38   [7] A.J. Jerri, "The Shannon sampling theorem -- its various extensions and applications: A tutorial review, " Proceedings of the IEEE, vol. 65, pp. 1565-- 1594, November 1977.

188.   Doc     Context   37   [29] M. J. D. Powell, "Restart Procedures for the Conjugate Gradient Method", Mathematical Programming 12 (1977), pp. 241-254.

189.   Doc     Context   37   1. Blasgen M, Eswaran K (1977) Storage and access in relational data bases.<F3.17e+05> IBM Sys.<F3.733e+05> J, 16(4):362--377

190.   Doc     Context   37   [17] Jensen, G.R., Higher order contact of submanifolds of homogeneous spaces, Lecture Notes in Math., No. 610, Springer--Verlag, New York, 1977.

191.   Doc     Context   37   [Abr77] N. Abramson. The throughput of packet broadcasting channels. IEEE Trans. Comm., COM-25:117--128, January 1977.

192.   Doc     Context   37   [70] E.M. Reingold, J. Nievergelt, and N. Deo. Combinatorial Algorithms. Prentice-Hall, Englewood Cliffs. NJ, 1977.

193.   Doc     Context   37   1. Bledsoe, W. W., Non-resolution theorem proving, Artificial Intelligence 9, pp. 1--35 (1977).

194.   Doc     Context   37   7. F. Glover. Heuristic for Integer Programming Using Surrogate Constraints. Decision Sciences, 8:156--166, 1977.

195.   Doc     Context   37   [Ben77] J. L. Bentley. Algorithms for Klee's rectangle problem. Computer Science Department, Carnegie-Mellon Univ., Pittsburgh, PA., 1977.

196.   Doc     Context   37   [20] K. Weiler and P. Atherton, "Hidden Surface Removal Using Polygon Area Sorting", Computer Graphics, 11(2), pp. 214--222, Summer 1977.

197.   Doc     Context   37   [11] H. B. Keller. "Numerical solution of bifurcation and nonlinear eigenvalue problems". In Applications of Bifurcation Theory, pages 359--384. Academic Press, New York, N.Y., 1977. P. H. Rabinowitz, ed., Mathematics Research Center Publication 8.

198.   Doc     Context   37   [4] J.E. Dennis, Jr. and J.J. Mor' e, Quasi-Newton methods, Motivation and the theory, SIAM Rev., 19 (1977), pp. 46-89.

199.   Doc     Context   36   2. D.J. Slate and L.R. Atkin, Chess 4.5 - The Northwestern University Chess Program, in Chess Skill in Man and Machine, P.W. Frey (ed.), Springer-Verlag, New York, 1977, 82118.

200.   Doc     Context   35   [15] R. Millman and G. Parker. Elements of Differential Geometry. Prentice Hall, 1977.

CiteSeer.Continuity homepage

CiteSeer.Continuity - Copyright NEC and IST