Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonathan S. Sandberg

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

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Theory of computation · 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.

Theoretical computer science
2 papers
Algorithms and data structures · 57% Computational geometry · 43%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory layout
0.011992
How to Store a Triangular Matrix · IEEE Trans. Computers 1992
Computational geometry
graph drawing
0.011985
A method for drawing graphs · SCG 1985
Computational geometry › graph drawing
straight-line drawing
0.011985
A method for drawing graphs · SCG 1985

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

arithmetic progression analysis · 0.0graph layout algorithm · 0.0
YearPublicationVenuePosition
1993 Certifiable optical character recognition
abstract
A general-purpose approach for enhancing the accuracy of optical character recognition is described. By taking the view that the printed page is a data transmission channel, the authors raise the possibility of error detecting/correcting codes designed specifically for the OCR process. They present experimental results that demonstrate the feasibility of fully automated, 100% accurate OCR for computer typeset documents.>
Daniel P. Lopresti, Jonathan S. Sandberg
ICDAR2
1992 How to Store a Triangular Matrix
abstract
The problem of storing a triangular matrix so that each row and column is stored as a vector, i.e. the locations form an arithmetic progression, is discussed. Storing rows and columns as vectors can speed up access significantly. It is shown that there is no such storage method that does not waste approximately one-half of the computer memory.>
Andrea S. LaPaugh, Richard J. Lipton, Jonathan S. Sandberg
IEEE Trans. Computers3
1985 A method for drawing graphs
abstract
Article Free Access Share on A method for drawing graphs Authors: R. J. Lipton Princeton University, Princeton, NJ Princeton University, Princeton, NJView Profile , S. C. North AT&T Bell Laboratories, Murray Hill, New Jersey AT&T Bell Laboratories, Murray Hill, New JerseyView Profile , J. S. Sandberg AT&T Bell Laboratories, Murray Hill, New Jersey AT&T Bell Laboratories, Murray Hill, New JerseyView Profile Authors Info & Claims SCG '85: Proceedings of the first annual symposium on Computational geometryJune 1985 Pages 153–160https://doi.org/10.1145/323233.323254Online:01 June 1985Publication History 40citation611DownloadsMetricsTotal Citations40Total Downloads611Last 12 Months14Last 6 weeks6 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Richard J. Lipton, Stephen C. North, Jonathan S. Sandberg
SCG3