![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Jan Tijmen Udding
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j10]Amir Hossein Gharehgozli
, Yugang Yu, René M. B. M. de Koster
, Jan Tijmen Udding:
An exact method for scheduling a yard crane. Eur. J. Oper. Res. 235(2): 431-447 (2014) - 2013
- [j9]M. P. M. Hendriks, Erjen Lefeber
, Jan Tijmen Udding:
Simultaneous berth allocation and yard planning at tactical level. OR Spectr. 35(2): 441-456 (2013) - 2012
- [j8]M. P. M. Hendriks, Dieter Armbruster, Marco Laumanns
, Erjen Lefeber
, Jan Tijmen Udding:
Design of Robust Distribution Networks Run by Third Party Logistics Service Providers. Adv. Complex Syst. 15(5) (2012) - 2010
- [j7]Maarten Hendriks, Marco Laumanns
, Erjen Lefeber
, Jan Tijmen Udding:
Robust cyclic berth planning of container vessels. OR Spectr. 32(3): 501-517 (2010)
2000 – 2009
- 2009
- [c19]Dieter Armbruster, M. P. M. Hendriks, Erjen Lefeber, Jan Tijmen Udding:
Structural Properties of Third-Party Logistics Networks. LDIC 2009: 3-13
1990 – 1999
- 1999
- [c18]Willem C. Mallon, Jan Tijmen Udding, Tom Verhoeff
:
Analysis and Applications of the XDI model. ASYNC 1999: 231-242 - [c17]Rix Groenboom, Paul Dechering, Edwin D. de Jong, Jan Tijmen Udding:
Formalization of a Software Architecture for Embedded Systems: A Process Algebra for SPLICE. HICSS 1999 - 1998
- [c16]Willem C. Mallon, Jan Tijmen Udding:
Building Finite Automata from DI Specifications. ASYNC 1998: 184-193 - 1997
- [c15]Paul G. Lucassen, Indra Polak, Jan Tijmen Udding:
Normal Form in DI-Algebra with Recursion. ASYNC 1997: 167-174 - [c14]Willem C. Mallon, Jan Tijmen Udding:
Using Metrics for Proof Rules for Recursively Defined Delay-insensitive Specifications. ASYNC 1997: 175- - 1996
- [c13]Paul G. Lucassen, Jan Tijmen Udding:
On the correctness of the Sproull counterflow pipeline processor. ASYNC 1996: 112-120 - [c12]H. Keegstra, Walter J. Jansen, J. A. G. Nijhuis, Lambert Spaanenburg, H. Stevens, Jan Tijmen Udding:
Exploiting network redundancy for low-cost neural network realizations. ICNN 1996: 951-955 - 1995
- [c11]Rudi van Drunen, Lambert Spaanenburg, Paul G. Lucassen, J. A. G. Nijhuis, Jan Tijmen Udding:
Arithmetic for Relative Accuracy. IEEE Symposium on Computer Arithmetic 1995: 208- - [c10]Rix Groenboom, Chris Hendriks, Indra Polak, Jan Terlouw, Jan Tijmen Udding:
Algebraic Proof Assistants in HOL. MPC 1995: 304-321 - 1994
- [c9]Mark B. Josephs, Paul G. Lucassen, Jan Tijmen Udding, Tom Verhoeff:
Formal design of an asynchronous DSP counterflow pipeline: a case study in handshake algebra. ASYNC 1994: 206-215 - 1993
- [c8]Rix Groenboom, Mark B. Josephs, Paul G. Lucassen, Jan Tijmen Udding:
Normal Form in a Delay-Insensitive Algebra. Asynchronous Design Methodologies 1993: 57-70 - [c7]Mark B. Josephs, Jan Tijmen Udding:
Implementing a Stack as a Delay-insensitive Circuit. Asynchronous Design Methodologies 1993: 123-135 - 1992
- [j6]Anne Kaldewaij, Jan Tijmen Udding:
Rank Order Filters and Priority Queues. Distributed Comput. 6(2): 99-105 (1992) - [c6]Mark B. Josephs, Rudolf H. Mak, Jan Tijmen Udding, Tom Verhoeff, Jelio Todorov Yantchev:
High-Level Design of an Asynchronous Packet-Routing Chip. Designing Correct Circuits 1992: 261-274 - 1990
- [j5]Wei Chen
, Jan Tijmen Udding:
Program Inversion: More than Fun! Sci. Comput. Program. 15(1): 1-13 (1990) - [c5]Mark B. Josephs
, Jan Tijmen Udding:
An Algebra for Delay-Insensitive Circuits. CAV 1990: 343-352 - [c4]Mark B. Josephs
, Jan Tijmen Udding:
Delay-Insensitive Circuits: An Algebraic Approach to their Design. CONCUR 1990: 342-366 - [c3]Mark B. Josephs, Jan Tijmen Udding:
An Algebra for Delay-Insensitive Circuits. CAV (DIMACS/AMS volume) 1990: 147-176
1980 – 1989
- 1989
- [j4]David Gries
, Alain J. Martin, Jan L. A. van de Snepscheut, Jan Tijmen Udding:
An Algorithm for Transitive Reduction of an Acyclic Graph. Sci. Comput. Program. 12(2): 151-155 (1989) - [c2]Wei Chen, Jan Tijmen Udding, Tom Verhoeff
:
Networks of Communicating Processes and Their (De-)Composition. MPC 1989: 174-196 - [c1]Wei Chen
, Jan Tijmen Udding:
Towards a Calculus of Data Refinement. MPC 1989: 197-218 - 1986
- [j3]Jan Tijmen Udding:
A Formal Model for Defining and Classifying Delay-Insensitive Circuits and Systems. Distributed Comput. 1(4): 197-204 (1986) - [j2]Jan Tijmen Udding:
Absence of Individual Starvation Using Weak Semaphores. Inf. Process. Lett. 23(3): 159-162 (1986) - [j1]Jan L. A. van de Snepscheut, Jan Tijmen Udding:
An Alternative Implementation of Communication Primitives. Inf. Process. Lett. 23(5): 231-238 (1986)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint