default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Cull
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c22]Xingcheng Liu
, Kai Cao, Feng Han, Paul Cull:
A Practical Joint Network-Compressed Coding Scheme for Energy-Efficient Data Gathering in Cooperative Wireless Sensor Networks. CSE/EUC (2) 2017: 70-76- [c21]Paul Cull:
Nicolas Rashevsky: Mathematical Biophysicist. EUROCAST (1) 2017: 33-40 - [c20]Rick Hangartner, Paul Cull:
Inscrutable Decision Makers: Knightian Uncertainty in Machine Learning. EUROCAST (1) 2017: 228-236 - [c19]Paul Cull:
The Computer and the Calculator. EUROCAST (1) 2017: 237-244 - 2015
- [c18]Paul Cull:
Population Models and Enveloping. EUROCAST 2015: 150-157 - 2013
- [j17]Paul Cull:
BIOCOMPUTATION: Some history and prospects. Biosyst. 112(3): 196-203 (2013) - [j16]Paul Cull, Leanne Merrill, Tony Van:
A Tale of Two Puzzles: Towers of Hanoi and Spin-Out. Inf. Media Technol. 8(3): 695-709 (2013) - [j15]Paul Cull, Leanne Merrill, Tony Van:
A Tale of Two Puzzles: Towers of Hanoi and Spin-Out. J. Inf. Process. 21(3): 378-392 (2013) - [c17]Paul Cull, Leanne Merrill, Tony Van, Celeste Burkhardt, Tommy Pitts:
Solving Towers of Hanoi and Related Puzzles. EUROCAST (1) 2013: 12-19 - 2010
- [j14]Kang Wang, Xingcheng Liu, Paul Cull:
Adaptive SNR estimation algorithms for decoding block turbo codes. Kybernetes 39(8): 1298-1304 (2010)
2000 – 2009
- 2009
- [c16]Javad Azimi, Paul Cull, Xiaoli Z. Fern:
Clustering Ensembles Using Ants Algorithm. IWINAC (1) 2009: 295-304 - 2007
- [j13]Paul Cull:
The mathematical biophysics of Nicolas Rashevsky. Biosyst. 88(3): 178-184 (2007) - 2005
- [c15]Tai Hsu, Paul Cull:
Walking Tree Method for Stereo Vision. CAINE 2005: 340-343 - [c14]Paul Cull:
Convergence of Iterations. EUROCAST 2005: 457-466 - 2004
- [c13]Tai Hsu, Paul Cull:
Parallel Walking Tree Method for Sequence Recombination. PDCS 2004: 7-12 - 2003
- [c12]Paul Cull, Tai Hsu:
Recent Advances in the Walking Tree Method for Biological Sequence Alignment. EUROCAST 2003: 349-359 - 2001
- [j12]Thomas R. Amoth, Paul Cull, Prasad Tadepalli:
On Exact Learning of Unordered Tree Patterns. Mach. Learn. 44(3): 211-243 (2001) - [c11]Tai Hsu, Paul Cull:
Gene Verification and Discovery by Walking Tree Method. Pacific Symposium on Biocomputing 2001: 287-298 - 2000
- [j11]Jerrold R. Griggs, Michael Woltermann, B. Borchers, David Callan, Robin J. Chapman, J. Chilcott, Paul Cull, A. Ferguson, K. Martin, G. G. Gagola, Solomon W. Golomb, J. Guilford, S. Louis Hakimi, Edward F. Schmeichel, J. K. Haugland, C. H. Jepson, R. Johnsonbaugh, André Kündgen, S. Levandosky, J. T. Lewis, John H. Lindsey II, O. P. Lossers, Reiner Martin, R. Morris, Gerald Myerson, José Heber Nieto, E. Rykken, J. Sorensen, J. Schlosberg, W. Seaman, J. T. Ward, Z. Zeuge:
Tiling Rectangles with Trominoes: 10641. Am. Math. Mon. 107(2): 179 (2000)
1990 – 1999
- 1999
- [j10]Paul Cull, Ingrid Nelson:
Error-correcting codes on the towers of Hanoi graphs. Discret. Math. 208-209: 157-175 (1999) - [j9]Paul Cull:
Table-automata/ finite co-finite languages. SIGACT News 30(1): 41 (1999) - [c10]Thomas R. Amoth, Paul Cull, Prasad Tadepalli:
Exact Learning of Unordered Tree Patterns from Queries. COLT 1999: 323-332 - [c9]Paul Cull, Tai-Ching Hsu:
Improved Parallel and Sequential Walking Tree Methods for Biological String Alignments. SC 1999: 51 - 1998
- [j8]Paul Cull, Shawn M. Larson:
Smaller diameters in hypercube-variant networks. Telecommun. Syst. 10(1): 175-184 (1998) - [c8]Thomas R. Amoth, Paul Cull, Prasad Tadepalli:
Exact Learning of Tree Patterns from Queries and Counterexamples. COLT 1998: 175-186 - 1997
- [c7]Richard Wodtli, Paul Cull:
Calypso: A Visual Language for Data Structures Programming. VL 1997: 166-167 - 1995
- [j7]R. D. Hangartner, Paul Cull:
A ternary logic model for recurrent neuromime networks with delay. Biol. Cybern. 73(2): 177-188 (1995) - [j6]Paul Cull, Shawn M. Larson:
On Generalized Twisted Cubes. Inf. Process. Lett. 55(1): 53-55 (1995) - [j5]Paul Cull, Shawn M. Larson:
The Möbius Cubes. IEEE Trans. Computers 44(5): 647-659 (1995) - 1994
- [j4]Paul Cull, Rajeev Pandey:
Isomorphism and the N-Queens problem. ACM SIGCSE Bull. 26(3): 29-36 (1994) - [c6]John A. Gunnels, Paul Cull, James L. Holloway:
Genetic Algorithms and Simulated Annealing for Gene Mapping. International Conference on Evolutionary Computation 1994: 385-390 - [c5]Paul Cull, Shawn M. Larson:
A Linear Equation Model for Twisted Cube Networks. ICPADS 1994: 709-715 - [c4]James L. Holloway, Paul Cull:
Aligning Genomes with Inversions and Swaps. ISMB 1994: 195-202 - [c3]Paul Cull, Shawn M. Larson:
Wormhole routing algorithms for twisted cube networks. SPDP 1994: 696-703 - 1993
- [c2]Paul Cull, Shawn M. Larson:
Static and Dynamic Performance of the Möbius Cubes. PARLE 1993: 92-103 - 1992
- [c1]Paul Cull, Shawn M. Larson:
The Möbus Cubes: Improved Cubelike Networks for Parallel Computation. IPPS 1992: 610-613
1980 – 1989
- 1989
- [j3]Paul Cull, James L. Holloway:
Computing fibonacci numbers quickly. Inf. Process. Lett. 32(3): 143-149 (1989) - 1986
- [j2]Colin Gerety, Paul Cull:
Time complexity of the Towers of Hanoi problem. SIGACT News 18(1): 80-87 (1986) - 1980
- [j1]Paul Cull:
Tours of Graphs, Digraphs, and Sequential Machines. IEEE Trans. Computers 29(1): 50-54 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
