Joel Katcoff

dblp:17/2495 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel algorithms
0.011982
Upper Bounds for Speedup in Parallel Parsing · J. ACM 1982
Parallel and multicore computing › parallel algorithms › parallel string algorithms
parallel parsing
0.011982
Upper Bounds for Speedup in Parallel Parsing · J. ACM 1982
Parallel and multicore computing › parallel computation models
speedup bounds
0.011982
Upper Bounds for Speedup in Parallel Parsing · J. ACM 1982
Compilers and program optimization › parsing
parallel parsing
0.011982
Upper Bounds for Speedup in Parallel Parsing · J. ACM 1982
Compilers and program optimization
parsing
0.011982
Upper Bounds for Speedup in Parallel Parsing · J. ACM 1982

Methods — techniques the papers use, named apart from their topics

speedup analysis · 0.0parallel parsing · 0.0
YearPublicationVenuePosition
1982 Upper Bounds for Speedup in Parallel Parsing
abstract
article Free Access Share on Upper Bounds for Speedup in Parallel Parsing Authors: Jacques Cohen Computer Science Program, Brandeis University, Waltham, MA Computer Science Program, Brandeis University, Waltham, MAView Profile , Timothy Hickey Mathematics Department, University of Chicago, Chicago, IL Mathematics Department, University of Chicago, Chicago, ILView Profile , Joel Katcoff Kaye, Scholer, Fierman, Hays and Handler, 425 Park Avenue, New York, NY Kaye, Scholer, Fierman, Hays and Handler, 425 Park Avenue, New York, NYView Profile Authors Info & Claims Journal of the ACMVolume 29Issue 2April 1982 pp 408–428https://doi.org/10.1145/322307.322316Published:01 April 1982Publication History 26citation413DownloadsMetricsTotal Citations26Total Downloads413Last 12 Months17Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Jacques Cohen, Timothy J. Hickey, Joel Katcoff
J. ACM3
1977 Automatic Solution of a Certain Class of Combinatorial Problems
Jacques Cohen, Joel Katcoff
Inf. Process. Lett.2
1977 Symbolic Solution of Finite-Difference Equations
abstract
An interactive computer program which has some capability for solving systems of finite difference equations is described.Although this capability is limited to linear systems, a knowledgeable user can, with the help of the program, solve a wider class of equations.Over 100 examples, covering a variety of cases, have been solved by using the program.Some representative examples are presented.Additional features which would improve the versatility of the program are also discussed.
Jacques Cohen, Joel Katcoff
ACM Trans. Math. Softw.2