default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTinus Strauss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c13]Derrick G. Kourie, Tinus Strauss, Loek Cleophas, Bruce W. Watson:
Using CSP to Develop Quality Concurrent Software. Principled Software Development 2018: 165-184- 2017
- [c12]Tinus Strauss, Bruce W. Watson, Derrick G. Kourie, Loek Cleophas
:
CSP for Parallelising Brzozowski's DFA Construction Algorithm. The Role of Theory in Computer Science 2017: 217-244 - 2014
- [c11]Derrick G. Kourie, Bruce W. Watson, Tinus Strauss, Loek G. Cleophas, Melanie Mauch:
Empirically Assessing Algorithm Performance. SAICSIT 2014: 115 - [c10]Tinus Strauss, Derrick G. Kourie, Bruce W. Watson, Loek G. Cleophas:
A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm. Stringology 2014: 17-29 - 2012
- [c9]Bruce W. Watson, Derrick G. Kourie, Tinus Strauss:
A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching. IWOCA 2012: 236-248 - [c8]Melanie Mauch, Derrick G. Kourie, Bruce W. Watson, Tinus Strauss:
Performance assessment of dead-zone single keyword pattern matching. SAICSIT 2012: 59-68 - 2011
- [c7]Tinus Strauss, Martin S. Olivier:
Network Forensics in a Clean-Slate Internet Architecture. ISSA 2011
2000 – 2009
- 2009
- [j4]Gareth Nicholls, Derrick G. Kourie, Tinus Strauss:
Sensitivity analysis of Voronoi-based sensor deployment and reconfiguration algorithms. South Afr. Comput. J. 43: 35-43 (2009) - [c6]Loek G. Cleophas, Derrick G. Kourie, Tinus Strauss, Bruce W. Watson:
On Minimizing Deterministic Tree Automata. Stringology 2009: 173-182 - 2008
- [j3]Tinus Strauss, Derrick G. Kourie, Martin S. Olivier:
A comparison of simulated traffic conditioner performance. Comput. Commun. 31(17): 3933-3940 (2008) - [j2]Tinus Strauss, Derrick G. Kourie, Bruce W. Watson:
A Concurrent Specification of Brzozowski's DFA Construction Algorithm. Int. J. Found. Comput. Sci. 19(1): 125-135 (2008) - [j1]Bruce W. Watson, Derrick G. Kourie, Tinus Strauss, Ernest Ketcha Ngassam, Loek G. Cleophas:
Efficient Automata Constructions and Approximate Automata. Int. J. Found. Comput. Sci. 19(1): 185-193 (2008) - [c5]Stefan Gruner, Derrick G. Kourie, Markus Roggenbach, Tinus Strauss, Bruce W. Watson:
A New CSP Operator for Optional Parallelism. CSSE (2) 2008: 788-791 - [c4]Tinus Strauss, Derrick G. Kourie, Bruce W. Watson:
A Concurrent Specification of an Incremental DFA Minimisation Algorithm. Stringology 2008: 218-226 - 2006
- [c3]Tinus Strauss, Martin S. Olivier, Derrick G. Kourie:
Logical Traffic Isolation Using Differentiated Services. IFIP Int. Conf. Digital Forensics 2006: 229-237 - [c2]Tinus Strauss, Derrick G. Kourie, Bruce W. Watson:
A concurrent specification of Brzozowski's DFA construction algorithm. Stringology 2006: 90-99 - [c1]Bruce W. Watson, Derrick G. Kourie, Ernest Ketcha Ngassam, Tinus Strauss, Loek G. Cleophas:
Efficient automata constructions and approximate automata. Stringology 2006: 100-107
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-04-24 22:54 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:
