Jay Belanger

14 papers B 2Misc 3Journal 6Unranked 3
YearRankTypeTitle / Venue / Authors
2002 J jnl
Simulating hybrid dynamic systems.
IEEE Robotics Autom. Mag.
Camille Alain Rabbath, M. Abdoune, Jay Belanger, Kenneth R. Butts
2001 B conf
A MuPAD Library for Differential Equations.
CASC
Jay Belanger, Marcus Hausdorf, Werner M. Seiler
2000 Misc conf
Real-time simulations: effective real-time simulations of event-based systems.
WSC
Camille Alain Rabbath, M. Abdoune, Jay Belanger
1999 J jnl
Reductions Do Not Preserve Fast Convergence Rates in Average Time.
Algorithmica
Jay Belanger, Aduri Pavan, Jie Wang
1997 J jnl
No NP Problems Averaging Over Ranking of Distributions are Harder.
Theor. Comput. Sci.
Jay Belanger, Jie Wang
1996 Misc conf
Reductions and Convergence Rates of Average Time.
COCOON
Jay Belanger, Jie Wang
1995 J jnl
On the NP-Isomorphism Problem with Respect to Random Instances.
J. Comput. Syst. Sci.
Jie Wang, Jay Belanger
1995 J jnl
Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions
Electron. Colloquium Comput. Complex.
Jay Belanger, Jie Wang
1995 Misc conf
Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions.
COCOON
Jay Belanger, Jie Wang
1993 J jnl
Honest Iteration Schemes of Randomizing Algorithms.
Inf. Process. Lett.
Jie Wang, Jay Belanger
1993 — conf
Isomorphisms of NP Complete Problems on Random Instances.
SCT
Jay Belanger, Jie Wang
1992 B conf
Honest Iteration Schemes of Randomizing Algorithms.
ISAAC
Jie Wang, Jay Belanger
1992 — conf
On Average P vs. Average NP.
SCT
Jie Wang, Jay Belanger
1992 — conf
On Average P vs. Average NP.
Complexity Theory: Current Research
Jay Belanger, Jie Wang