Welcome, visitor! [ Login

 

X. Gao and J. Li, “Focal shift of apodized tunrcated hyperbolic-cosine-Gaussian beam,” Optics Communications, Vol. 273, pp. 21–27, 2007.

  • Listed: 2 August 2026 1 h 08 min

Description

X. Gao and J. Li, “Focal shift of apodized tunrcated hyperbolic-cosine-Gaussian beam,” Optics Communications, Vol. 273, pp. 21–27, 2007.

None

No Tags

3 total views, 3 today

  

Listing ID: N/A

Report problem

Processing your request, Please wait....

Sponsored Links

 

V. Paruthi and A. Kuehlmann, “Equivalence checking using cuts a structural ...

V. Paruthi and A. Kuehlmann, “Equivalence checking using cuts a structural SAT-solver, BDDs and simulation,” International Conference Computer Design, 2000. Here’s a thinking process: 1. […]

No views yet

 

A. Kuehlmann and F. Krohm, “Equivalence checking using cuts and heaps,” Pro...

A. Kuehlmann and F. Krohm, “Equivalence checking using cuts and heaps,” Proceedings of Design Automation Conference, pp. 263–268, 1997. Here’s a thinking thinking sequence 1. […]

1 total views, 1 today

 

J. R. Burch and V. Singhal, “Tight integration of combinational verificatio...

J. R. Burch and V. Singhal, “Tight integration of combinational verification methods,” IEEE/ACM International Conference on CAD, pp. 570–576, 1998. **J. R. Burch and V. […]

No views yet

 

P. W. C. Prasad, A. Assi, A. Harb, and V. C. Prasad, “Binary decision diagr...

P. W. C. Prasad, A. Assi, A. Harb, and V. C. Prasad, “Binary decision diagrams: An improved variable ordering using graph representation of boolean functions,” […]

1 total views, 1 today

 

R. Drechsler, B. Becker, and N. G?ckel, “A genetic algorithm for variable o...

R. Drechsler, B. Becker, and N. G?ckel, “A genetic algorithm for variable ordering of OBDDs,” International Workshop on Logic Synthesis, pp. P5c:5.55–5.64, 1995. A Genetic […]

No views yet

 

R. E. Bryant, “Graph based algorithms for Boolean function representation,”...

R. E. Bryant, “Graph based algorithms for Boolean function representation,” IEEE Transactions on Computers, Vol. C-35, pp. 677–690, 1986. “R. E. Bryant, “Graph based algorithms […]

1 total views, 1 today

 

L. Fortune, J. Hopcroft, and E. M. Schmidt, “The complexity of equivalence ...

L. Fortune, J. Hopcroft, and E. M. Schmidt, “The complexity of equivalence and containment for free single variable program schemes,” in: Goos, Hartmanis, Ausiello, Baum […]

No views yet

 

S. B. Akers, “Binary decision diagrams,” IEEE Transactions on Computers, Vo...

S. B. Akers, “Binary decision diagrams,” IEEE Transactions on Computers, Vol. C-27, pp, 509–516, 1978. Here’s a thinking process: 1. **Analyze User Input:** – **Role:** […]

No views yet

 

C. Y. Lee, “Representation of switching circuits by binary-decision program...

C. Y. Lee, “Representation of switching circuits by binary-decision programs,” Bell Systems Technology Journal, Vol. 38, pp. 985–999, 1959. Here’s a thinking process: 1. **Analyze […]

1 total views, 1 today

 

M. C. Morrone, J. Ross, and D. C. Burr, “Apparent position of visual target...

M. C. Morrone, J. Ross, and D. C. Burr, “Apparent position of visual targets during real and simulated saccadic eye movements,” Journal of Neuroscience 17, […]

1 total views, 1 today

 

V. Paruthi and A. Kuehlmann, “Equivalence checking using cuts a structural ...

V. Paruthi and A. Kuehlmann, “Equivalence checking using cuts a structural SAT-solver, BDDs and simulation,” International Conference Computer Design, 2000. Here’s a thinking process: 1. […]

No views yet

 

A. Kuehlmann and F. Krohm, “Equivalence checking using cuts and heaps,” Pro...

A. Kuehlmann and F. Krohm, “Equivalence checking using cuts and heaps,” Proceedings of Design Automation Conference, pp. 263–268, 1997. Here’s a thinking thinking sequence 1. […]

1 total views, 1 today

 

J. R. Burch and V. Singhal, “Tight integration of combinational verificatio...

J. R. Burch and V. Singhal, “Tight integration of combinational verification methods,” IEEE/ACM International Conference on CAD, pp. 570–576, 1998. **J. R. Burch and V. […]

No views yet

 

P. W. C. Prasad, A. Assi, A. Harb, and V. C. Prasad, “Binary decision diagr...

P. W. C. Prasad, A. Assi, A. Harb, and V. C. Prasad, “Binary decision diagrams: An improved variable ordering using graph representation of boolean functions,” […]

1 total views, 1 today

 

R. Drechsler, B. Becker, and N. G?ckel, “A genetic algorithm for variable o...

R. Drechsler, B. Becker, and N. G?ckel, “A genetic algorithm for variable ordering of OBDDs,” International Workshop on Logic Synthesis, pp. P5c:5.55–5.64, 1995. A Genetic […]

No views yet

 

R. E. Bryant, “Graph based algorithms for Boolean function representation,”...

R. E. Bryant, “Graph based algorithms for Boolean function representation,” IEEE Transactions on Computers, Vol. C-35, pp. 677–690, 1986. “R. E. Bryant, “Graph based algorithms […]

1 total views, 1 today

 

L. Fortune, J. Hopcroft, and E. M. Schmidt, “The complexity of equivalence ...

L. Fortune, J. Hopcroft, and E. M. Schmidt, “The complexity of equivalence and containment for free single variable program schemes,” in: Goos, Hartmanis, Ausiello, Baum […]

No views yet

 

S. B. Akers, “Binary decision diagrams,” IEEE Transactions on Computers, Vo...

S. B. Akers, “Binary decision diagrams,” IEEE Transactions on Computers, Vol. C-27, pp, 509–516, 1978. Here’s a thinking process: 1. **Analyze User Input:** – **Role:** […]

No views yet

 

C. Y. Lee, “Representation of switching circuits by binary-decision program...

C. Y. Lee, “Representation of switching circuits by binary-decision programs,” Bell Systems Technology Journal, Vol. 38, pp. 985–999, 1959. Here’s a thinking process: 1. **Analyze […]

1 total views, 1 today

 

M. C. Morrone, J. Ross, and D. C. Burr, “Apparent position of visual target...

M. C. Morrone, J. Ross, and D. C. Burr, “Apparent position of visual targets during real and simulated saccadic eye movements,” Journal of Neuroscience 17, […]

1 total views, 1 today