Derick Wood

140 papers receiving 1.5k citations

Peers

Derick Wood
Comparison fields: 5 of 80
  • Computer Graphics and Computer-Aided Design 355
  • Computational Theory and Mathematics 725
  • Artificial Intelligence 927
  • Signal Processing 252
  • Computer Networks and Communications 401
Replace S. Rao Kosaraju with:
S. Rao Kosaraju United States
Hisao Tamaki Japan
Fabrizio Luccio Italy
Leo J. Guibas United States
Harry B. Hunt United States
Marek Karpiński Germany
Takao Nishizeki Japan
Venkatesh Raman India
J. Ian Munro Canada
Yossi Shiloach Israel
Derick Wood relative to S. Rao Kosaraju United States S. Rao Kosaraju's profile →
Citations per field
00.5×1.6×
S. Rao Kosaraju · 1×
Citations per year

Countries citing papers authored by Derick Wood

Since Specialization
Citations

This map shows the geographic impact of Derick Wood's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Derick Wood with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Derick Wood more than expected).

Fields of papers citing papers by Derick Wood

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Derick Wood. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Derick Wood. The network helps show where Derick Wood may publish in the future.

Co-authors

The 25 scholars most cited alongside Derick Wood, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Derick Wood Line = papers co-authored together Derick Wood links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1
State complexity of prefix-free regular languages
20066
2
Prime decompositions of regular languages
20066
3
Restricted-Orientation Convexity (Monographs in Theoretical Computer Science)
20044
4
On the optimality of holistic algorithms for twig queries
20031
5 20023
6
Caterpillars, context, tree automata and tree pattern matching.
19994
7
Extended Context-free Grammars and Normal Form Algorithms
19991
8
SGML and Exceptions
19973
9
Tabular formatting problems
19979
10
Three-dimensional Restricted-Orient at Ion Convexity
19961
11
O-Convexity Computing Hulls Approximations and Orientation Sets
19962
12
Tabular abstraction for tabular editing and formatting
19932
13
Generalized Kernels of Polygons with Holes.
19930
14
A Generic Adaptive Sorting Algorithm.
19923
15
Roughly sorting: a generalization of sorting
19912
16 19912
17
Drawing Trees Nicely with TeX
19895
18
On Binary Trees.
19890
19 19881
20
A Realistic Cost Measure for Binary Search Trees.
19811

About Derick Wood

Derick Wood is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics and Signal Processing, having authored 152 papers that have together received 1.7k indexed citations. Recurring topics across this work include semigroups and automata theory (47 papers), Algorithms and Data Compression (36 papers), Computational Geometry and Mesh Generation (32 papers), DNA and Biological Computing (24 papers), Natural Language Processing Techniques (20 papers), Data Management and Algorithms (16 papers), Digital Image Processing Techniques (14 papers) and Logic, programming, and type systems (14 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (355 citations), Computational Theory and Mathematics (725 citations), Artificial Intelligence (927 citations), Signal Processing (252 citations) and Computer Networks and Communications (401 citations). Derick Wood has collaborated with scholars based in Canada, Hong Kong and Germany. Frequent co-authors include Anne Brüggemann-Klein, Vladimir Estivill‐Castro, Thomas Ottmann, Yo-Sub Han, Karel Čulík, Eljas Soisalon-Soininen, Eugene Fink, Arto Salomaa, Jan Van Leeuwen and Sheng Yü. Their work appears in journals such as Information Sciences, Theoretical Computer Science, Information and Computation, International Journal of Foundations of Computer Science and Discrete Applied Mathematics.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026