http:^^www.cs.washington.edu^homes^ladner^papers.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 445 行 · 第 1/2 页
HTML
445 行
Date: Tue, 10 Dec 1996 14:54:46 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Wed, 27 Nov 1996 21:53:13 GMTContent-length: 16744<html><head><TITLE>Papers of Richard E. Ladner</TITLE></head><body><h1>Papers of Richard E. Ladner</h1><H3>Recent On-Line Papers</H3>The following are the most current versions of some of myarticles. All papers are in postscript format (or compressed postscript).You can also browse the departmental <a href=/research/tr/techreports.shtml> technical reports</a>.<ul><li><a href=ftp://ftp.cs.washington.edu/tr/1996/10/UW-CSE-96-10-01.PS.Z><b>The Influence of Caches on the Performance of Sorting.</b></a>A. LaMarca and R.E. Ladner. This paper will appear in the Proceedingsof the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,January, 1997.<p><li><a href=ftp://ftp.cs.washington.edu/tr/1996/09/UW-CSE-96-09-02.PS.Z><b>Sorting by Parallel Insertion on a One-Dimensional Sub-Bus Array.</b></a>J.D. Fix and R.E. Ladner. This paper was recently submitted forpublication.<p><li><a href=ftp://ftp.cs.washington.edu/tr/1996/02/UW-CSE-96-02-03.PS.Z><b>The Influence of Caches on the Performance of Heaps.</b></a>A. LaMarca and R.E. Ladner. This paper was recently accepted toACM Journal of Applied Algorithmics.<p><li><a href=ftp://ftp.cs.washington.edu/tr/1994/11/UW-CSE-94-11-01.PS.Z><b>Optimal One-Way Sorting on a One-Dimensional Sub-Bus Array.</b></a>J. Fix and R.E Ladner. This paper appeared inSixth Annual ACM-SIAM Symposium on Discrete Algorithms,January, 1995, 586-594.<p><li><a href=ftp://ftp.cs.washington.edu/tr/1994/09/UW-CSE-94-09-02.PS.Z><b>Optimizing Static Calendar Queues.</b></a>K.B. Erickson, R.E. Ladner, and A. LaMarca. This paper appeared in35th Annual Symposium on Foundations of Computer Science, November, 1994,732-743, .<p><li><a href=ftp://ftp.cs.washington.edu/tr/1993/10/UW-CSE-93-10-02.PS.Z><b>Complexity of Sub-Bus Mesh Computations.</b></a>A. Condon, R. Ladner, J. Lampe, and R. Sinha. This paper appeared in<EM> SIAM Journal on Computing</EM>, Vol. 25, No. 3, 1996, 520-539.<p> <li><a href=ftp://ftp.cs.washington.edu/tr/1993/04/UW-CSE-93-04-09.PS.Z><b>Building Counting Networks from Larger Balancers.</b></a>E.W. Felten, A. LaMarca, and R.E Ladner. This paper is a Department ofComputer Science and Engineering, University of Washington TechnicalReport TR 93-04-09.<p><li><a href=ftp://ftp.cs.washington.edu/tr/1992/12/UW-CSE-92-12-08.PS.Z><b>Theory and Practice of Vector Quantizers Trained on SmallTraining Sets.</b></a>D. Cohn, E.A. Riskin, and R.Ladner. This paper appeared<EM> IEEE Transactions on Pattern Analysis and Machine Intelligence</EM>,Vol. 16, 1994, 54-65.<p></ul></body></html><H3>Papers in Refereed Journals</H3><UL><LI>A. LaMarca and R.E. Ladner.The Influence of Caches on the Performance of Heaps.To appear in the <EM> Journal of Applied Algorithmics</EM>.<LI> R.-Y. Wang, E.A. Riskin, and R. Ladner.Codebook Organization to Enhance Maximum A Posteriori Detectionof Progressive Transmission of Vector Quantized Images over NoisyChannels.<EM> IEEE Transactions on Image Processing</EM>, Vol. 5, No. 1, 1996, 37-48.<LI> A. Condon, R.E. Ladner, J. Lampe, and R. Sinha.Complexity of Sub-Bus Mesh Computations. <EM> SIAM Journal on Computing</EM>, Vol. 25, No. 3, 1996, 520-539.<LI> E. Tempero and R. Ladner. Recoverable Sequence TransmissionProtocols. <EM> Journal of the ACM</EM>, Vol. 42, No. 5, 1995, 1059-1090.<LI> A. Condon and R. Ladner. Interactive Proof Systems withPolynomial Bounded Strategies. <EM> Journal of Computer and Systems Sciences, Vol. 50</EM>, 1995, 506-518.<LI> E.A. Riskin, R. Ladner, L.E., R.Y. Wang, and L.E. Atlas.Index Assignment for Progressive Transmission of Full Search VectorQuantization. Correspondence in <EM> IEEE Transactions on Image Processing</EM>Vol. 3, No. 3 1994, 307-312.<LI> D. Cohn. E.A. Riskin, R. Ladner. Theory and Practice of Vector Quantizers Trained on Small Training Sets.<EM> IEEE Transactions on Pattern Analysis and Machine Intelligence</EM>,Vol. 16, 1994, 54-65.<LI> D. Cohn, L. Atlas, R. Ladner. Improving Generalization withSelf-Directed Learning. <EM> Machine Learning</EM>, Vol. 15, 1994, 201-221.<LI> P. Beame, E. Brisson, and R.E. Ladner. The Complexity ofComputing Symmetric Functions Using Threshold Circuits. <EM> Theoretical Computer Science, Vol. 100</EM>, 1992, 253-265. <LI> S. Chaudhuri and R.E. Ladner. Safety and Liveness of$\omega$-Context-Free Languages. <EM> Information Processing Letters, Vol. 37</EM>, 1991, 13-20.<LI> R.E. Ladner, Polynomial Space Counting Problems. <EM> SIAM Journal on Computing, Vol. 18</EM>, December 1989, 1087-1097.<LI> R.E. Ladner, Computer Accessibility for Federal Workers withDisabilities: It's the Law. <EM> Communications of the ACM, Vol. 32, No. 8</EM>, August, 1989, 952-956.<LI> A. Condon and R.E. Ladner, Probabilistic Game Automata.<EM> Journal of Computer and System Sciences, Vol. 36. No. 3</EM>,June 1988, 452-489<LI> A.G. Greenberg, P. Flajolet, R.E. Ladner, Estimating theMultiplicities of Conflicts to Speed Their Resolution in MultipleAccess Channels. <EM> Journal of the ACM, Vol. 34, No. 2</EM>, April 1987,289-325<LI> R.E. Ladner and J. K. Norman, Solitaire Automata,<EM> Journal of Computer and System Sciences, Vol. 30, No. 1</EM>, February 1985,116-129<LI> R. E. Ladner, L. J. Stockmeyer, and R. J. Lipton, Alternation BoundedAuxiliary Pushdown Automata. <EM> Information and Control, Vol. 62, Nos. 2/3</EM>,August/September 1984, 93-108<LI> U. Manber and R.E. Ladner, Concurrency Control in a Dynamic SearchStructure. <EM> ACM Transactions on Database Systems, vol. 9, no. 3.</EM> September1984, 439-455<LI> E. P. Glinert and R. E. Ladner, A Large Font Virtual Terminal Interface -A Software Prosthesis for the Visually Impaired.<EM> Communications of the ACM, vol. 27, no. 6</EM>, June 1984, 567-572<LI> V. Klee, R. E. Ladner, and R. Manber, Signsolvability Revisited.<EM> Linear Algebra and Its Applications vol. 59</EM>, 1984, 131-157<LI> R. E. Ladner, R. J. Lipton, L. J. Stockmeyer, AlternatingPushdown and Stack Automata. <EM> SIAM Journal on Computing, vol. 13, no. 1</EM>,February 1984, 135-155<LI> J.-L. Baer, H. C. Du, and R. E. Ladner, Binary Search in a MultiprocessingEnvironment. <EM> IEEE Transactions on Computers, vol. c-32, no.7</EM>, July 1983,667-677<LI> A. G. Greenberg, R. E. Ladner, M. S. Paterson, and Z. Galil, Efficient Parallel Algorithms for Linear Recurrence Computation.<EM> Information Processing Letters, vol. 15, no. 1</EM>, August 1982, 31-35<LI> R. E. Ladner, The Complexity of Problems in Systems ofCommunicating Sequential Processes. <EM> Journal ofComputer and System Sciences, vol. 21, no.2</EM>, October 1980, 179-194<LI> R. E. Ladner and M. J. Fischer, Parallel Prefix Computation.<EM> Journal of the ACM, vol. 27, no. 4</EM>, October 1980, 831-838<LI> P. Honeyman, R. E. Ladner, and M. Yannakakis, Testing theUniversal Instance Assumption. <EM> Information Processing Letters,vol. 10, no. 1</EM>, February l980, 14-19<LI> M. J. Fischer and R. E. Ladner, Propositional Dynamic Logicof Regular Programs. <EM> Journal of Computer and System Sciences,vol. 18, no. 2</EM>, April 1979, 194-211<LI> R. E. Ladner, The Computational Complexity of Provabilityin Systems of Modal Propositional Logic. <EM> SIAM Journal onComputing, vol. 6, no. 3</EM>, September 1977, 467-480<LI> R. E. Ladner, Application of Model Theoretic Games toDiscrete Linear Orders and Finite Automata. <EM> Information andControl, vol. 33, no. 4</EM>, April 1977, 281-303<LI> R. E. Ladner and N. A. Lynch, Relativization of Questionsabout Log Space Computability. <EM> Mathematical Systems Theory,vol. 10, no. 1</EM>, 1976, 19-32⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?