Jay Belanger

According to our database, Jay Belanger authored at least 11 papers between 1992 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Simulating hybrid dynamic systems.

Camille Alain Rabbath, M. Abdoune, Jay Belanger, Kenneth R. Butts

IEEE Robotics Autom. Mag., 2002

2001

A MuPAD Library for Differential Equations.

Jay Belanger, Marcus Hausdorf, Werner M. Seiler

Proceedings of the Computer Algebra in Scientific Computing, 2001

2000

Real-time simulations: effective real-time simulations of event-based systems.

Camille Alain Rabbath, M. Abdoune, Jay Belanger

Proceedings of the 32nd conference on Winter simulation, 2000

1999

Reductions Do Not Preserve Fast Convergence Rates in Average Time.

Jay Belanger, Aduri Pavan, Jie Wang

Algorithmica, 1999

1997

No NP Problems Averaging Over Ranking of Distributions are Harder.

Jay Belanger, Jie Wang

Theor. Comput. Sci., 1997

1996

Reductions and Convergence Rates of Average Time.

Jay Belanger, Jie Wang

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

On the NP-Isomorphism Problem with Respect to Random Instances.

Jie Wang, Jay Belanger

J. Comput. Syst. Sci., 1995

Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions

Jay Belanger, Jie Wang

Electron. Colloquium Comput. Complex., 1995

1993

Honest Iteration Schemes of Randomizing Algorithms.

Jie Wang, Jay Belanger

Inf. Process. Lett., 1993

Isomorphisms of NP Complete Problems on Random Instances.

Jay Belanger, Jie Wang

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

On Average P vs. Average NP.

Jay Belanger, Jie Wang

Proceedings of the Complexity Theory: Current Research, 1992