Jan Tijmen Udding

According to our database1, Jan Tijmen Udding authored at least 28 papers between 1986 and 2014.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
An exact method for scheduling a yard crane.
Eur. J. Oper. Res., 2014

2013
Simultaneous berth allocation and yard planning at tactical level.
OR Spectrum, 2013

2012
Design of Robust Distribution Networks Run by Third Party Logistics Service Providers.
Advances in Complex Systems, 2012

2010
Robust cyclic berth planning of container vessels.
OR Spectrum, 2010

2009
Structural Properties of Third-Party Logistics Networks.
Proceedings of the Dynamics in Logistics, Second International Conference, 2009

1999
Formalization of a Software Architecture for Embedded Systems: A Process Algebra for SPLICE.
Proceedings of the 32nd Annual Hawaii International Conference on System Sciences (HICSS-32), 1999

Analysis and Applications of the XDI model.
Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '99), 1999

1998
Building Finite Automata from DI Specifications.
Proceedings of the 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '98), 30 March, 1998

1997
Using Metrics for Proof Rules for Recursively Defined Delay-insensitive Specifications.
Proceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997

Normal Form in DI-Algebra with Recursion.
Proceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997

1996
Exploiting network redundancy for low-cost neural network realizations.
Proceedings of International Conference on Neural Networks (ICNN'96), 1996

On the correctness of the Sproull counterflow pipeline processor.
Proceedings of the 2nd International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '96), 1996

1995
Algebraic Proof Assistants in HOL.
Proceedings of the Mathematics of Program Construction, 1995

Arithmetic for Relative Accuracy.
Proceedings of the 12th Symposium on Computer Arithmetic (ARITH-12 '95), 1995

1994
Formal design of an asynchronous DSP counterflow pipeline: a case study in handshake algebra.
Proceedings of the International Symposium on Advanced Research in Asynchronous Circuits and Systems, 1994

1993
Implementing a Stack as a Delay-insensitive Circuit.
Proceedings of the Asynchronous Design Methodologies, Proceedings of the IFIP WG10.5 Working Conference on Asynchronous Design Methodologies, Manchester, UK, 31 March, 1993

Normal Form in a Delay-Insensitive Algebra.
Proceedings of the Asynchronous Design Methodologies, Proceedings of the IFIP WG10.5 Working Conference on Asynchronous Design Methodologies, Manchester, UK, 31 March, 1993

1992
Rank Order Filters and Priority Queues.
Distributed Computing, 1992

High-Level Design of an Asynchronous Packet-Routing Chip.
Proceedings of the Designing Correct Circuits, 1992

1990
Program Inversion: More than Fun!
Sci. Comput. Program., 1990

Delay-Insensitive Circuits: An Algebraic Approach to their Design.
Proceedings of the CONCUR '90, 1990

An Algebra for Delay-Insensitive Circuits.
Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1989
An Algorithm for Transitive Reduction of an Acyclic Graph.
Sci. Comput. Program., 1989

Networks of Communicating Processes and Their (De-)Composition.
Proceedings of the Mathematics of Program Construction, 1989

Towards a Calculus of Data Refinement.
Proceedings of the Mathematics of Program Construction, 1989

1986
Absence of Individual Starvation Using Weak Semaphores.
Inf. Process. Lett., 1986

An Alternative Implementation of Communication Primitives.
Inf. Process. Lett., 1986

A Formal Model for Defining and Classifying Delay-Insensitive Circuits and Systems.
Distributed Computing, 1986


  Loading...