Result 1 to 20 of 29 total
io-port 05892458 Koester, Steven J.;
Young, Albert M.;
Yu, Roy R.;
Purushothaman, Sampath;
Chen, Kuan-Neng;
La Tulipe Jr., Douglas C.;
Rana, Narender;
Shi, Leathen;
Wordeman, Matthew R.;
Sprogis, Edmund J.
Wafer-level 3D integration technology. (English)
IBM J. Res. Dev. 52, No. 6, 583-597 (2008).
1
A simple 4 quadrant NMOS analog multiplier with input range equal to +/-VDD and very low THD (English)
EIT, 134-139 (2008).
2
Evaluation and fuzzy classification of gene finding programs on human genome sequences (English)
FSKD (2), 821-829 (2005).
3
Optimal placement by branch-and-price (English)
ASP-DAC, 337-342 (2005).
4
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (English)
Mathematical and Computer Modelling 40, No. 13, 1465-1472 (2004).
5
Well-abstracted transition systems: Application to FIFO automata. (English)
Inf. Comput. 181, No. 1, 1-31 (2003).
6
Towards fast solid state DNA sequencing (English)
ISCAS (4), 169-172 (2002).
7
Well-abstracted transition systems (extended abstract). (English)
Palamidessi, Catuscia (ed.), CONCUR 2000 - Concurrency theory. 11th international conference, University Park, PA, USA, August 22-25, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1877, 566-580 (2000).
8
Well-abstracted transition systems (English)
CONCUR, 566-580 (2000).
9
Programming languages and systems. (English)
Rao, C. R. (ed.), Computational statistics. Amsterdam: North-Holland. Handb. Stat. 9, 141-168 (1993).
10
NAPAW 92. Proceedings of the 1st North American Process Algebra, Workshop, Stony Brook, NY, USA, 28 August 1992. (English)
Workshops in Computing. London: Springer-Verlag (in coll. with the British Computer Society). viii, 241 p. DM 84.00; öS 655.20; sFr 84.00 /sc (1993).
11
A uniform treatment of order of evaluation and aggregate update. (English)
Theor. Comput. Sci. 118, No.2, 231-262 (1993).
12
From operational definitions to abstract semantics (English)
FPCA, 276-288 (1993).
13
NAPAW 92, Proceedings of the first north american process algebra workshop, stony brook, New York, USA, 28 agust 1992 (English)
Workshops in Computing: NAPAW (1993).
14
Analysis of a class of communicating finite state machines. (English)
Acta Inf. 29, No.6-7, 499-522 (1992).
15
Empty stack pushdown omega-tree automata (English)
CAAP, 248-264 (1992).
16
An adequate operational semantics for sharing in lazy evaluation (English)
ESOP, 435-450 (1992).
17
A unified approach to the deadlock detection problem in networks of communicating finite state machines. (English)
Computer-aided verification, Proc. 2nd Int. Conf., CAV ’90, New Brunswick/NJ (USA), Lect. Notes Comput. Sci. 531, 243-252 (1991).
18
A unified approach to the deadlock detection problem in networks of communicating finite state machines. (English)
Computer-aided verification ’90, Proc. 2nd DIMACS Workshop, New Brunswick/NJ (USA) 1990, DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 3, 395-404 (1991).
19
Data flow analysis of communicating finite state machines (English)
ACM Trans. Program. Lang. Syst. 13, No. 3, 399-442 (1991).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
