Jay Belanger

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Simulating hybrid dynamic systems.
IEEE Robotics Autom. Mag., 2002

2001
A MuPAD Library for Differential Equations.
Proceedings of the Computer Algebra in Scientific Computing, 2001

2000
Real-time simulations: effective real-time simulations of event-based systems.
Proceedings of the 32nd conference on Winter simulation, 2000

1999
Reductions Do Not Preserve Fast Convergence Rates in Average Time.
Algorithmica, 1999

1997
No NP Problems Averaging Over Ranking of Distributions are Harder.
Theor. Comput. Sci., 1997

1996
Reductions and Convergence Rates of Average Time.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
On the NP-Isomorphism Problem with Respect to Random Instances.
J. Comput. Syst. Sci., 1995

Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions
Electron. Colloquium Comput. Complex., 1995

1993
Honest Iteration Schemes of Randomizing Algorithms.
Inf. Process. Lett., 1993

Isomorphisms of NP Complete Problems on Random Instances.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
On Average P vs. Average NP.
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992


  Loading...