Search

Your search keyword '"Hartmanis, Juris"' showing total 187,292 results
Start Over Author "Hartmanis, Juris"

Refine your results

more »

more »

more »

more »
187,292 results on '"Hartmanis, Juris"'

2. Turing Machine-Inspired Computer Science Results

Author

Hartmanis, Juris, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cooper, S. Barry, editor, Dawar, Anuj, editor, and Löwe, Benedikt, editor

Published
2012
Full Text
View/download PDF

6. Structural complexity theory: Recent surprises

Author

Hartmanis, Juris, Chang, Richard, Ranjan, Desh, Rohatgi, Pankaj, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Gilbert, John R., editor, and Karlsson, Rolf, editor

Published
1990
Full Text
View/download PDF

23. Turing Award lecture: on computational complexity and the nature of computer science

Author

Hartmanis, Juris

Subjects
Association for Computing Machinery -- Achievements and awards, Computer science -- Achievements and awards
Abstract

In scientific work, the recognition by one's peers is one of the greatest rewards. In particular, an official recognition by the scientific community, as Richard Stearns and I are honored […]

Published
1994

25. Some observations about NP complete sets

Author

Hartmanis, Juris, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Budach, Lothar, editor, Bukharajev, Rais Gatič, editor, and Lupanov, Oleg Borisovič, editor

Published
1987
Full Text
View/download PDF

27. Complexity classes without machines: On complete languages for UP

Author

Hartmanis, Juris, Hemachandra, Lane, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, and Kott, Laurent, editor

Published
1986
Full Text
View/download PDF

28. On sparse oracles separating feasible complexity classes

Author

Hartmanis, Juris, Hemachandra, Lane, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Monien, B., editor, and Vidal-Naquet, G., editor

Published
1986
Full Text
View/download PDF

29. On complete problems for NP∩CoNP

Author

Hartmanis, Juris, Immerman, Neil, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, and Brauer, Wilfried, editor

Published
1985
Full Text
View/download PDF

31. DNA sequencing, Eulerian graphs, and the exact perfect matching problem

Author

Blazewicz, J., Formanowicz, P., Kasprzak, M., Schuurman, P., Woeginger, Gerhard, Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Kucera, Ludek, Discrete Mathematics and Mathematical Programming, and Stochastic Operations Research

Subjects
Combinatorics, Discrete mathematics, Computational complexity theory, Counting problem, Bin packing problem, METIS-208662, 3-dimensional matching, P versus NP problem, Vertex cover, Function problem, Computer Science::Formal Languages and Automata Theory, Polynomial-time reduction, Mathematics
Abstract

We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer l together with a set S of words of length k over the four symbols A, C, G, T. The problem is to decide whether there exists a word of length l that contains every word in S at least once as a subword, and does not contain any other subword of length k. The computational complexity of this problem has been open for some time, and it remains open. What we prove is that this problem is polynomial time equivalent to the exact perfect matching problem in bipartite graphs, which is another infamous combinatorial optimization problem of unknown computational complexity.

Published
2002
Full Text
View/download PDF

32. The Cornell Commission On Morris and the Worm.

Author

Eisenberg, Ted, Gries, David, Hartmanis, Juris, Holcomb, Don, Lynn, M. Stuart, and Santoro, Thomas

Subjects
COMPUTER viruses, INTERNET security
Abstract

Summarizes key findings of an internal investigative commission at Cornell University that studied the creation and spread of a worm program, a type of computer virus, which attacked Internet sites in the United States in 1988. Impact of the worm; Magnitude of damages caused by the worm; Violations committed by the worm's creator, Robert Tappan Morris.

Published
1989
Full Text
View/download PDF

44. 4871

Author

Hartmanis, Juris, Perel, W. M., and Wherritt, R. C.

Published
1961
Full Text
View/download PDF

46. SDL Time Extensions from a Semantic Point of View.

Author

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Sherratt, Edel, and Prinz, Andreas

Abstract

During the work with the SDL formal semantics, we had also to formalize the SDL time behavior. The semantics given finally was made such that it was applicable for a more general time model, too. This article analyses some properties of time in general, of time in ASM and of time in SDL. Afterwards a set of time axioms for the properties of SDL are stated as an input for discussion. [ABSTRACT FROM AUTHOR]

Published
2003
Full Text
View/download PDF

47. Expression of Time and Duration Constraints in SDL.

Author

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Sherratt, Edel, and Graf, Susanne

Abstract

In this paper we give an overview on a set of time related features, useful in the context of real-time system design and classify them into two categories, those needed for modelling of non functional aspects and analysis, and those needed for functional design. We allow the distinction between functional and non functional timing aspects of a specification. We show how these features are represented at the semantic level with a minimal number of primitives. [ABSTRACT FROM AUTHOR]

Published
2003
Full Text
View/download PDF

48. The Graphical Format of TTCN-3 in the Context of MSC and UML.

Author

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Sherratt, Edel, Schieferdecker, Ina, and Grabowski, Jens

Abstract

Graphical system design techniques like Message Sequence Chart (MSC) and Unified Modelling Language (UML) are gaining more and more acceptance because they ease the development, understanding, and maintenance of software systems. In the testing area no accepted graphical test specification and implementation techniques exist. To overcome this shortcoming, a graphical presentation format for the Testing and Test Control Notation (GFT) has been defined. GFT supports the graphical design, implementation, visualization, documentation and tracing of test behaviour. GFT is based on MSC and extends it with test specific concepts like verdicts and defaults. GFT is also the basis for the definition of a UML testing profile to enable the integrated system and test development with UML models. This paper discusses GFT and its relation to MSC and to the UML testing profile. [ABSTRACT FROM AUTHOR]

Published
2003
Full Text
View/download PDF

49. An Extension for MSC-2000 and Its Application.

Author

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Sherratt, Edel, Zheng, Tong, and Khendek, Ferhat

Abstract

Message Sequence Charts (MSC) is a standard language widely used in telecommunication software engineering. The latest MSC standard, MSC-2000, includes new features such as time and data. In this paper, we propose a new construct called instance delay as an extension for timed MSC to further enhance its expressiveness.We formally define the semantics of the extension based on a partial order semantics of timed MSC. We demonstrate through an application the need for this extension. [ABSTRACT FROM AUTHOR]

Published
2003
Full Text
View/download PDF

50. MSC Connectors - The Philosopher's Stone.

Author

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Sherratt, Edel, Graubmann, Peter, and Rudolph, Ekkart

Abstract

Component oriented modelling by means of Message Sequence Charts requires new language constructs for an adequate description of the component communication. The communication between parts of a system, i.e., its components, follows interaction patterns which are expressed in the component oriented world as software connectors. The employment of MSCs for the description of both, connectors and components, has turned out to be a very promising concept. In analogy to decomposed instances, MSC connectors may be viewed also as High Level messages for the refinement of the communication behaviour, a construct which is still missing in the MSC language. The communication of MSC components via MSC connectors is suitably defined by means of the matching of component and connector interface descriptions, thereby, employing a partitioning of the component environment description. The matching procedure between MSC components and MSC connectors can be described by means of a partial order semantics. [ABSTRACT FROM AUTHOR]

Published
2003
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results