Abraham, J., see Viswanathan, H.
Abramsky, S., Jagadeesan, R.:
Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract) (Invited Talk),
12, 291--301
Aceto, L., Engberg, U.:
Failures Semantics for a Simple Process Language with Refinement,
11, 89--108
Agarwal, P.K., Kreveld, M.:
Implicit Point Location in Arrangements of Line Segments, With an Application to Motion Planning,
12, 80--91
Agarwala, R., Fernandez-Baca, D.:
Solving the Lagrangian Dual When the Number of Constraints is Fixed,
12, 164--175
Aggarwal, S., Kutten, S.:
Time Optimal Self-Stabilizing Spanning Tree Algorithms,
13, 400--410
Agha, G., Hewitt, C.:
Concurrent Programming Using Actors: Exploiting Large-Scale Parallelism,
05, 19--41
Agrawal, M., Beigel, R., Thierauf, T.:
Pinpointing Computation with Modular Queries,
16, 322--334
Agrawal, M.:
NP-Hard Sets and Creativeness Over Constant Time Languages,
11, 224--241
Aguzzi, G., Modigliani, U.:
Proving Termination of Logic Programs by Transforming Them Into Equivalent Term Rewriting Systems,
13, 114--124
Ahuja, M., Zhu, Y.:
An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks,
09, 99--108
Ahuja, N., see Veenstra, J.
Ait-Kaci, H., Garrigue, J.:
Label-Selective $\lambda$-Calculus Syntax and Confluence,
13, 24--40
Aizawa, K., see Nakamura, A.
Albert, L.:
Average Case Complexity Analysis of RETE Pattern-Match Algorithm and Average Size of Join in Databases,
09, 223--241
de Alfaro, L., see Bianco, A.
Allender, E.:
Circuit Complexity before the Dawn of the New Millennium (Invited Talk),
16, 1--18
Amadio, R.M., Prasad, S.:
Localities and Failures (Extended Summary),
14, 205--216
Anand, K.C.:
Experience with the Task Structuring for a Real Time System,
01, 75--86
Antoine, C., Goff, B.L., Pin, J-E.:
A Graphic Language Based on Timing Diagrams,
13, 306--316
Apt, K.R., Pnueli, A., Stavi, J.:
Fair Termination Revisited - With Delay,
02, 146--170
Arbib, C., Italiano, G.F., Panconest, A.:
Predicting Deadlock in Store-and-Forward Networks,
08, 123--142
Arikati, S.R., Chaudhuri, S., Zaroliagis, C.D.:
All-Pairs Min-Cut in Sparse Networks,
15, 363--376
Arikati, S.R., Maheshwari, A.:
An O(n) Algorithm for Realizing Degree Sequences (Extended Abstract),
14, 125--136
Armbruster, D.:
On the Calling Behaviour of Procedures,
05, 150--161
Arora, A., Gouda, M.:
Distributed Reset (Extended Abstract),
10, 316--331
Arora, V., Santosh, V., Saran, H., Vazirani, V.V.:
A Limited-Backtrack Greedy Schema for Approximation Algorithms,
14, 318--329
Arun-Kumar, S., see Goregaokar, S.R.
Arun-Kumar, S., see Jain, K.
Arvind, V., Biswas, S.:
Kernel Constructible Languages,
03, 520--538
Arvind, V., Biswas, S.:
On Certain Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas,
07, 456--469
Arvind, V., Kobler, J., Mundhenk, M.:
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets,
12, 140--151
Arvind, Maessen, J.-W., Nikhil, S., Stoy, J.:
A Lambda Calculus with Letrecs and Barriers (Invited Talk),
16, 19--36
Arvind:
Demand-Driven Evaluation on Dataflow Machine (Invited Talk) (Text not received),
05, 411
Asarin, E., Maler, O.:
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy,
15, 471--483
Asberg, B., Blanco, G., Bose, P., Garcia-Lopez, J., Overmars, M., Toussaint, G., Wilfong, G., Zhu, B.:
Feasibility of Design in Stereolithography,
13, 228--237
Astesiano, E., Zucca, E.:
Parametric Channels in CCS and Their Applications,
02, 82--95
Atkinson, M.P., Morrison, R.:
Persistent First Class Procedures are Enough,
04, 223--240
Autebert, J-M.:
Abstract Families of Automata with Controls,
02, 136--145
Awerbuch, B., Kirousis, L.M., Kranakis, E., Vitanyi, P.M.B.:
A Proof Technique for Register Atomicity (Preliminary Version),
08, 286--303
Bacchus, F., Grove, A.J., Halpern, J.Y., Koller, D.:
Generating Degrees of Belief from Statistical Information: An Overview (Invited Talk),
13, 318--325
Back, R.J.R., Mannila, H.:
On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes,
03, 40--65
Baeten, J.C.M., Glabbeek, R.J.:
Merge and Termination in Process Algebra,
07, 153--172
Bagchi, A., see Pal, A.K.
Bagchi, A., Mahanti, A.:
Admissible Heuristic Search in AND/OR Graphs,
01, 9--19
Bagchi, A., Srimani, P.K.:
Heuristic Search in a Branch - And - Bound Framework,
02, 338--362
Bagrodia, R.:
A Distributed Algorithm to Implement N-Party Rendezvous,
07, 138--152
Bajaj, C.:
Geometric Optimization and the Polynomial Hierarchy,
05, 176--195
Bajaj, C.L., Dey, T.K.:
Robust Decompositions of Polyhedra,
09, 267--279
Bakel, S.:
Essential Intersection Type Assignment,
13, 13--23
Balasubramanian, R., Raman, V.:
Path Balance Heuristic for Self-Adjusting Binary Search Trees,
15, 338--348
Barendsen, E., Smetsers, S.:
Conventional and Uniqueness Typing in Graph Rewrite Systems (Extended Abstract),
13, 41--51
Basin, D., Matthews, S.:
A Conservative Extension of First-Order Logic and Its Applications to Theorem Proving,
13, 151--160
Baumann, P., Lermer, K.:
A Framework for the Specification of Reactive and Concurrent Systems in Z,
15, 62--79
Beauquier, D.:
Thin Homogeneous Sets of Factors,
06, 239--251
Beauvieux, A.:
A Method to Check Knowledge Base Consistency,
08, 455--468
Beigel, R., see Agrawal, M.
Bellot, P., Jay, V.:
Uniformly Applicative Structures, A Theory of Computability and Polyadic Functions,
08, 270--285
Berry, G.:
Preemption in Concurrent Systems (Invited Talk),
13, 72--93
Beynon, M.:
Replacement in Monotone Boolean Networks: An Algebraic Perspective,
04, 165--178
Bharati, A., Sangal, R., Chaitanya, V.:
Natural Language Processing, Complexity Theory and Logic (Extended Abstract) (Invited Lecture),
10, 410--420
Bhargava, B., Browne, S.:
A Generic Algorithm for Transaction Processing During Network Partitioning,
08, 509--519
Bhaskar, S., Buckley, G.N.:
Computations in Undistinguished Networks,
07, 124--137
Bhasker, J., Sahni, S.:
Via Assignment in Single Row Routing,
06, 154--176
Bhatt, P.C.P., see Nath, D.
Bhatt, P.C.P., see Saxena, S.
Bhatta, K.S.H.S.R., Karnick, H.:
A Resolution Rule for Well-Formed Formulae,
08, 400--418
Bhattacharjee, G.P., see Ghosh, R.K.
Bhattacharjee, G.P., see Gupta, P.
Bhattacharjee, G.P., see Mohanty, H.
Bhattacharjee, G.P., see Murthy, Y.D.
Bhattacharya, B., see Jadhav, S.
Bhattacharya, B.B., see Nandy, S.C.
Bhattacharya, B.B., see Sur-Kolay, S
Bhattacharya, B.B., Ghose, S., Sinha, B.P., Srimani, P.K.:
Heuristic Search Approach to Optimal Routing in a Distributed Architecture,
04, 152--164
Bhattacharya, B.B., Gupta, B., Choudhury, A.K.:
Generalized Circuit Signature of Combinational Logic Circuits,
01, 167--178
Bhattacharya, B.K.:
Usefulness of Angle-Sweep Over Line-Sweep,
11, 390--419
Bhattacharyya, P., Nagaraja, G.:
Learning Classes of Regular and Linear Languages in Valiant's Learnability Framework,
13, 444--453
Bianco, A., de Alfaro, L.:
Model Checking of Probabilistic and Nondeterministic Systems,
15, 499--513
Biswas, S, see Sanyal, A.
Biswas, S., see Arvind, V.
Biswas, S., Prasad, D.C., Pal, S.P.:
Algorithms for Convex Visibility Problems,
14, 181--192
Biswas, S.K., Kannan, S.:
Minimizing Space Usage in Evaluation of Expression Trees,
15, 377--390
Bjorner, D.:
Software Development Graphs - A Unifying Concept for Software Development? (Keynote Address),
06, 1--9
Blair, H.A., Subrahmanian, V.S.:
Paraconsistent Logic Programming,
07, 340--360
Blanco, G., see Asberg, B.
Blass, A., Gurevich, Y.:
Randomizing Reductions of Search Problems (Extended Abstract),
11, 10--24
Bloom, B., see Dsouza, A.
Blum, M.:
Program Checking (Invited Paper),
11, 1--9
Bonomi, F., Fleming, P.J., Steinberg, P.:
An Adaptive Regulator Approach for the Design of Load Sharing Algorithms,
09, 121--130
Boreale, M., Trevisan, L.:
On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract),
15, 294--308
Bose, P., see Asberg, B.
Breu, R., Zucca, E.:
An Algebraic Compositional Semantics of an Object Oriented Notation with Concurrency,
09, 131--142
Browne, I.A., Manna, Z., Sipma, H.B.:
Generalized Temporal Verification Diagrams,
15, 484--498
Browne, S., see Bhargava, B.
Broy, M., Hinkel, U., Nipkow, T., Prehofer, C., Schieder, B.:
Interpreter Verification for a Functional Language,
14, 77--88
Buckley, G.N., see Bhaskar, S.
Buckley, G.N., Silberschatz, A.:
Eliminating Cascading Rollback in Structured Databases,
04, 331--343
Buhrman, H., Homer, S.:
Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy,
12, 116--127
Burstall, R., Honsell, F.:
A Natural Deduction Treatment of Operational Semantics (Invited Talk),
08, 250--269
Case, J., Jain, S., Sharma, A.:
Complexity Issues for Vacillatory Function Identification,
11, 121--140
Case, J., Rajan, D.S., Shende, A.M.:
Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena,
10, 190--203
Caspi, P., Fernandez, J-C., Girault, A.:
An Algorithm for Reducing Binary Branchings,
15, 279--293
Castagna, G.:
A Meta-Language for Typed Object-Oriented Languages,
13, 52--71
Caucal, D.:
Branching Bisimulation for Context-Free Processes,
12, 316--327
Caussinus, H., Lemieux, F.:
The Complexity of Computing Over Quasigroups,
14, 36--47
Chaitanya, V., see Bharati, A.
Chakrabarti, P.P., see Dasgupta, P.
Chandra, A.:
Who Needs to Verify Programs if You Can Test Them (Invited Talk) (Text not received),
05, 346
Chandrasekaran, B., see Mittal, S.
Chandrasekaran, B., Narayanan, N.H.:
Towards a Theory of Commonsense Visual Reasoning (Invited Lecture),
10, 388--409
Chandrasekaran, see Lakshmanan, V.S.
Chandru, V., see Vinay, V.
Chandy, K.M., Misra, J.:
Parallelism and Programming: A Perspective (Invited Talk),
07, 173--194
Chandy, M.:
Paradigms for Distributed Computing (Invited Talk),
03, 192--201
Chaudhuri, S., see Arikati, S.R.
Chazelle, B., Monier, L.:
Unbounded Hardware is Equivalent to Deterministic Turing Machines,
01, 187--192
Chen, H-W., see Tan Q-P.
Cheng, A., see Nielsen, M.
Cheng, A., Esparza, J., Palsberg, J.:
Complexity Results for 1-Safe Nets,
13, 326--337
Cheng, K.H., Sahni, S.:
VLSI Systems for Matrix Multiplication,
05, 428--456
Cheriyan, J., Maheshwari, S.N.:
Analysis of Preflow Push Algorithms for Maximum Network Flow,
08, 30--48
Chou, C-T., Gopal, I.S.:
Linear Broadcast Routing (Text not received),
08, 122
Choudhury, A.K., see Bhattacharya, B.B.
Christoff, I,, see Christoff, L.
Christoff, I., see Natarajan, V.
Christoff, L., see Natarajan, V.
Christoff, L., Christoff, I,:
Reasoning About Safety and Liveness Properties for Probabilistic Processes,
12, 342--355
Cleaveland, R., see Natarajan, V.
Clint, M., see Narayana, K.T.
Codognet, P., Diaz, D., Rossi, F.:
Constraint Retraction in FD,
16, 168--179
Cohen, A.T., see Myers, T.J.
Conery, J.S., see Sundararajan, R.
Coquand, T., Dybjer, P.:
Inductive Definitions and Type Theory an Introduction (Preliminary Version) (Invited Talk),
14, 60--76
Couveignes, J-M., Diaz-Frias, J.F.:
On the Interactive Complexity of Graph Reliability,
14, 12--23
Crescenzi, P., Trevisan, L.:
On Approximation Scheme Preserving Reducibility and Its Applications (Extended Abstract),
14, 330--341
Crochemore, M.:
Constant-Space String-Matching,
08, 80--87
Cucker, F., Rossello, F.:
Recursiveness Over the Complex Numbers is Time-Bounded,
13, 260--267
Culik II, K., Dube, S.:
Automata-Theoretic Techniques for Image Generation and Compression,
10, 76--90
Culik II, K., Linna, M.:
The Equivalence Problem for n-tape Finite Automata with Simple Cycles,
07, 15--25
Dahlhaus, E.:
Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract),
14, 171--180
Dam, M.:
Fixed Points of Buchi Automata,
12, 39--50
Dare, V.R., see Siromoney, R.
Dare, V.R.:
Metric Topology on Infinite Derivations of Algebraic Grammars,
02, 307--320
Das, A., see Krithivasan, K.
Das, G., Kapoor, S., Smid, M.:
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees,
16, 64--75
Das, S.K., Deo, N., Prasad, S.:
Gate Matrix Layout Visited: Algorithmic Performance and Probabilistic Analysis,
09, 280--290
Dasgupta, P., Chakrabarti, P.P., DeSarkar, S.C.:
A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors,
15, 22--36
Dasgupta, P., Chakrabarti, P.P., DeSarkar, S.C.:
A New Competitive Algorithm for Agent Searching in Unknown Streets,
16, 147--155
Datta, A., Krithivasan, K.:
Path Planning with Local Information,
08, 108--121
Datta, A., Ramkumar, G.D.S.:
On Some Largest Empty Orthoconvex Polygons in a Point Set,
10, 270--285
Datta, A.K., Ghosh, S.:
Modular Synthesis of Deadlock-Free Control Structures,
06, 288--318
DeSarkar, S.C., see Dasgupta, P.
Debray, S.K., Frank, A.J., Smolka, S.A.:
On the Existence and Construction of Robust Communication Protocols for Unreliable Channels,
04, 136--151
Delcambre, M.L., see Rao, T.R.N.
Dendris, N.D., Kirousis, L.M., Stamatiou, Y.C., Thilikos, D.M.:
Partiality and Approximation Schemes for Local Consistency in Networks of Constraints,
15, 210--224
Deo, N., see Das, S.K.
Deo, N., see Quinn, M.J.
Dershowitz, N., Mitra, S.:
Higher-Order and Semantic Unification,
13, 139--150
Desai, S., see Irani, A.
Desharnais, J., Madhavji, N.H.:
Relation Level Semantics,
08, 304--328
Dessel, J., Radola, M-D.:
Proving Non-Reachability by Modulo-Place-Invariants,
14, 366--377
Dey, T.K., see Bajaj, C.L.
Dhall, S.K., see Lakshmivarahan, S.
Diaz, D., see Codognet, P.
Diaz-Frias, J.F., see Couveignes, J-M.
Dietzfelbinger, M., Hunhe, M.:
Matching Upper and Lower Bounds for Simulations of Several Tapes on One Multidimensional Tape,
14, 24--35
Dillon, L.K., see Ramakrishna, Y.S.
Diwan, A.A., Usharani, N.:
A Condition for the Three Colourability of Planar Locally Path Graphs,
15, 52--61
Dsouza, A., Bloom, B.:
On the Expressive Power of CCS,
15, 309--323
Dube, S., see Culik II, K.
Dubhashi, D.P., Mehlhorn, K., Ranjan, D., Thiel, C.:
Searching, Sorting and Randomized Algorithms for Central Elements and Ideal Counting in Posets,
13, 436--443
Dublish, P., Maheshwari, S.N.:
An \(O(n^2)\) Algorithm for Fan-Out Free Query Optimization,
07, 242--264
Dung, P.M., Kanchanasut, K.:
A Natural Semantics for Logic Programs with Negation,
09, 78--88
Dybjer, P., see Coquand, T.
Dybjer, P.:
Some Results on the Deductive Structure of Join Dependencies,
02, 55--81
Edelsbrunner, H.:
Smooth Surfaces for Multi-Scale Shape Representation (Invited Talk),
15, 391--412
Ehrig, H., Fey, W., Hansen, H., Lowe, M.:
Algebraic Software Development Concepts for Module and Configuration Families,
09, 181--192
Ekanadham, K., see Pingali, K.
Engberg, U., see Aceto, L.
Esparza, J., see Cheng, A.
Estivill-Castro, V., Wood, D.:
Foundations for Faster External Sorting (Extended Abstract),
14, 414--425
Fages, F.:
On the Semantics of Optimization Predicates in CLP Languages,
13, 193--204
Fernandez, J-C., see Caspi, P.
Fernandez-Baca, D., see Agarwala, R.
Fernau, H., Lange, K.-J., Reinhardt, K.:
Advocating Ownership,
16, 286--297
Ferrari, G.L., see Nicola, R.D.
Fey, W., see Ehrig, H.
Fiadeiro, J., Sernadas, A., Sernadas, C.:
Knowledgebases As Structured Theories,
08, 469--486
Finkel, A.:
Control of a Petri Net by a Finite Automaton,
03, 593--609
Flajolet, P.:
Methods in the Analysis of Algorithms (Invited Talk) (Text not received),
02,
Fleming, P.J., see Bonomi, F.
Follert, F., Schomer, E., Sellen, J., Smid, M., Thiel, C.:
Computing a Largest Empty Anchored Cylinder, and Related Problems,
15, 428--442
Fortnow, L.:
My Favorite Ten Complexity Theorems of the Past Decade (Invited Talk),
14, 256--275
Francez, N., see Taubenfeld, G.
Frank, A.J., see Debray, S.K.
Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.:
Incremental Algorithms for the Single-Source Shortest Path Problem (Extended Abstract),
14, 113--124
Frougny, C.:
Context-Free Grammars with Cancellation Properties,
03, 575--592
Fu, J-J., Lee, R.C.T.:
Voronoi Diagrams of Moving Points in the Plane,
10, 238--254
Fujimoto, R.M., see Rajopadhye, S.V.
Fujiwara, T., see Kaji, Y.
Furer, M., see Zachos, S.
Furer, M., Raghavachari, B.:
Contracting Plan Graphs Efficiently in Parallel,
11, 319--336
Furukawa, K., Ueda, K.:
GHC - A Language for a New Age of Parallel Programming (Invited Talk),
08, 364--376
Gambosi, G., Protasi, M., Talamo, M.:
An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests,
09, 252--266
Gandhe, M., Venkatesh, G., Sanyal, A.:
Correcting Type Errors in the Curry System,
16, 347--358
Ganesan, K.:
One-Way Functions and Isomorphism Conjecture,
12, 152--163
Gannett, E., Kothari, S.C., Yen, H-C.:
On Optimal Parallelization of Sorting Networks,
07, 195--206
Garcia-Lopez, J., see Asberg, B.
Garg, V.K., see Tomlinson, I.T.
Garg, V.K., Waldecker, B.:
Detection of Unstable Predicates in Distributed Programs,
12, 253--264
Garrigue, J., see Ait-Kaci, H.
Garrigue, J.:
The Transformation Calculus,
15, 151--165
Gathen, J.:
Computations in Rings with Valuations,
03, 111--128
Gathen, J.:
Irreducible Polynomials Over Finite Fields,
06, 252--262
Gerth, R., Shira, L.:
On Proving Communication Closedness of Distributed Layers,
06, 330--343
Gerth, R., de Roever, W.P., Roncken, M.:
A Study in Distributed Systems and Dutch Patriotism,
02, 192--233
Ghezzi, C,, Mandrioli, D., Tecchio, A.:
Program Simplification Via Symbolic Interpretation,
05, 116--128
Ghose, S., see Bhattacharya, B.B.
Ghosh, R.K., Bhattacharjee, G.P.:
A Parallel Algorithm for Finding a Fundamental Set of Cycles of an Undirected Graph,
01, 217--226
Ghosh, S., see Datta, A.K.
Ghosh, S.K., Maheshwari, A., Pal, S.P., Saluja, S., Veni Madhavan, C.E.:
Computing the Shortest Path Tree in a Weak Visibility Polygon,
11, 369--389
Ghosh, S.K.:
A Linear Time Algorithm for Decomposing a Monotone Polygon into Star-shaped Polygon,
03, 505--519
Ghosh, S.K.:
A Linear-time Algorithm for Determining the Intersection Type of Two Star Polygons (Extended Abstract),
04, 317--330
Ghosh, S.K.:
Computing a Viewpoint of a Set of Points Inside a Polygon,
08, 18--29
Gibbons, A., Hytter, W.:
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and its Applications,
06, 453--469
Gibert, J., Shepherd, J.:
From Algebra to Compiler: A Combinator-Based Implementation of Functional Programming,
03, 290--314
Girault, A., see Caspi, P.
Gire, F.:
Substitutions in Infinite Words and Adherences,
03, 171--191
Glabbeek, R.J., see Baeten, J.C.M.
Glauert, J., Khasidashvili, Z.:
Minimal Relative Normalization in Orthogonal Expression Reduction Systems,
16, 238--249
Godskesen, J.C., Larsen, K.G.:
Real-Time Calculi and Expansion Theorems,
12, 302--315
Goff, B.L., see Antoine, C.
Goldsmith, J., Hemachandra, L.A., Kunen, K.:
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions,
11, 212--223
Gopal, I.S., see Chou, C-T.
Gopal, I.S., Kermani, P.:
Distributed Resource Sharing in Computer Networks,
06, 319--329
Goregaokar, S.R., Arun-Kumar, S.:
A Characterization of Asynchronous Message-Passing,
06, 270--287
Goswami, A.K., Patnaik, L.M.:
Functional Programming Systems Revisited,
04, 44--59
Gouda, M., see Arora, A.
Granger, P.:
Improving the Results of Static Analyses of Programs by Local Decreasing Iterations (Extended Abstract),
12, 68--79
Gries, D.:
Modules for Re-Use,
07, 373--375
Gries, D.:
The Emerging Scientific Practice of Programming (Keynote Address),
02, 1--18
Gronning, P., Nielsen, T.Q., Lovengreen, H.H.:
Refinement and Composition of Transition-Based Rely-Guarantee Specifications with Auxiliary Variables,
10, 332--348
Grove, A.J., see Bacchus, F.
Gudmundsson, J., see Levcopoulos, C.
Guha, S., Suzuki, I.:
Proximity Problems and the Voronoi Diagram on a Rectilinear Plane with Rectangular Obstacles (Extended Abstract),
13, 218--227
Gunawardena, J.:
Deducing Causal Relationships in CCS,
09, 161--170
Gupta, B., see Bhattacharya, B.B.
Gupta, P., Bhattacharjee, G.P.:
An Efficient Algorithm for Random Sampling Without Replacement,
04, 435--442
Gupta, P., Bhattacharjee, G.P.:
Parallel Generation of Lexicographic Combinations,
01, 193--200
Gupta, P., Bhattacharjee, G.P.:
Parallel Generation of Permutations with Repetitions Lexicographically,
02, 378--399
Gupta, P., Bhattacharjee, G.P.:
Selection of the k-th Element in X + Y,
03, 454--487
Gurevich, Y., see Blass, A.
Gurevich, Y.:
Algebraic Operational Semantics (Invited Talk),
07, 1--2
Halldorsson, M.M., Radhakrishnan, J., Subrahmanyam, K.V.:
On Some Communication Complexity Problems Related to Threshold Functions,
13, 248--259
Halpern, J.Y., see Bacchus, F.
Hannemann, U., see Zwiers, J.
Hansdah, R.C., Patnaik, L.M.:
Weak Consistency of Read-Only Transactions: A Tool to Improve Concurrency in Heterogeneous Locking Protocols,
07, 265--281
Hansen, H., see Ehrig, H.
Hartmanis, J.:
Some Observations About the Nature of Computer Science (Invited Talk),
13, 1--12
Heller, H., see Zachos, S.
Hemachandra, L.A., see Goldsmith, J.
Hemachandra, L.A., Jain, S.:
On the Limitations of Locally Robust Positive Reductions,
09, 193--203
Hennessy, M.:
A Proof System for Communicating Processes with Value-Parsing (Invited Papers),
09, 325--339
Henson, M.C., Turner, R.:
A Constructive Set Theory for Program Development,
08, 329--347
Henson, M.C.:
Extending Advice on Structuring Compilers and Proving them Correct,
03, 315--342
Hentenryck, P.V., see Ramachandran, V.
Hewitt, C., see Agha, G.
Hinkel, U., see Broy, M.
Hoare, C.A.R.:
The Mathematics of Programming (Keynote Address),
05, 1--18
Hochbaum, D.S., Shmoys, D.B.:
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach,
06, 382--393
Homer, S., see Buhrman, H.
Homer, S.:
On Simple and Creative Sets in NP,
06, 412--425
Honda, K., Yoshida, N.:
On Reduction-Based Process Semantics,
13, 373--387
Honsell, F., see Burstall, R.
Hooker, J.N., Vinay, V.:
Branching Rules for Satisfiability (Extended Abstract),
14, 426--437
Hooman, J.:
Verifying Part of the ACCESS.bus Protocol Using PVS,
15, 96--110
Hopcroft, J.:
Robotics - A New Direction in Theoretical Computer Science (Keynote Address),
03, 1--19
Hsiang, J., Srivas, M:
Prolog-Based Inductive Theorem Proving,
05, 129--149
Huet, G.:
The Calculus of Constructions: State of the Art (Invited Talk) (Text not received),
07, 372
Huet, G.:
The Gallina Specification Language: A Case Study,
12, 229--240
Hung, D.V., Ji, W.:
On the Design of Hybrid Control Systems Using Automata Models,
16, 156--167
Hungar, H.:
Correctness of Programs Over Poor Signatures,
11, 109--120
Hunhe, M., see Dietzfelbinger, M.
Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.:
Approximation Schemes Using L-Reductions\(^1,^2,^3\),
14, 342--353
Huynh, T., Joskowicz, L., Lassez, C., Lassez, J-L.:
Reasoning About Linear Constraints Using Parametric Queries (Invited Paper),
10, 1--20
Hytter, W., see Gibbons, A.
Ibarra, O.H., Jiang, T., Wang, H.:
Parallel Parsing on a One-Way Linear Array of Finite-State Machines,
09, 291--300
Ibarra, O.H., Ravikumar, B.:
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation,
07, 26--43
Inoue, K., see Toda, M.
Irani, A., Vijayaraman, T.M., Desai, S., Kamala, V.:
Archie - A File Archival System,
03, 388--389
Iskander, A., see Rao, T.R.N.
Italiano, G.F., see Arbib, C.
Jadhav, S., Mukhopadhyay, A., Bhattacharya, B.:
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons,
12, 92--103
Jafri, A.:
Language of Functional Schemata for Parallel Processing,
01, 143--151
Jagadeesan, R., see Abramsky, S.
Jain, K., Arun-Kumar, S.:
Testing Processes for Efficiency,
16, 100--110
Jain, S., see Case, J.
Jain, S., see Hemachandra, L.A.
Jain, S.:
Branch and Bound on the Network Model,
15, 11--21
Jajodia, S.:
Universal and Representative Instances Using Unmarked Nulls,
04, 367--378
Jajoo, B.H., Sahasrabuddhe, H.V.:
Data Flow Analysis of Structured Programs,
01, 227--240
Jamison, B., Olariu, S.:
A Linear-Time Recognition Algorithm for P4-Reducible Graphs,
09, 1--19
Janas, J.M.:
On Functional Independencies,
08, 487--508
Janicki, R., Koutny, M.:
Order Structures and Generalisations of Szpilrajn's Theorem,
13, 348--357
Janin, D.:
Some Results About Logical Descriptions of Non Deterministic Behaviours,
13, 338--347
Jantzen, M., Kudlek, M.:
Homomorphic Images of Sentential Form Languages Defined by Semi Thue Systems,
02, 126--135
Jay, V., see Bellot, P.
Jayakumar, N., see Sastry, P.N.
Jensen, F.V., Larsen, K.G.:
Recursively Defined Domains and their Induction Principles,
05, 225--245
Ji, W., see Hung, D.V.
Jiang, T., see Ibarra, O.H.
Jiang, T., McDowell, E., Ravikumar, B.:
The Structure and Complexity of Minimal NFA's Over a Unary Alphabet,
11, 152--171
Jiang, Y.J.:
An Autoepistemic Logical View of Knowledge Base,
09, 68--77
Jonsson, B., see Yi, W.
Joseph, M., Moitra, A.:
Fault Tolerance in Communicating Processes,
02, 234--255
Joseph, M.:
Time and Real-Time in Programs (invited Papers),
09, 312--324
Joshi, A.K.:
Adequacy of Phrase Structure Grammars for Characterizing Structural Descriptions: Some Recent Developments (Invited Talk),
02, 277--282
Joskowicz, L., see Huynh, T.
Juang, J.T-Y., Venkatesan, S.:
Efficient Algorithms for Crash Recovery in Distributed Systems,
10, 349--361
Kaji, Y., Fujiwara, T., Kasami, T.:
Solving a Unification Problem Under Constrained Substitutions Using Tree Automata,
14, 276--287
Kalyanasundaram, B., Pruhs, K.:
Optimal Deterministic Algorithm for Online b-Matching,
16, 193--199
Kamala, V., see Irani, A.
Kamper, J.:
Non-Uniform Proof Systems: A New Framework to Describe Non-Uniform and Probabilistic Complexity Classes,
08, 193--210
Kanaoka, T., Tomita, S.:
A Whirl Decomposition of Stochastic Systems Based on the Substitution Property,
01, 287--296
Kanchanasut, K., see Dung, P.M.
Kane, R., Sahni, S.:
VLSI Systems for Design Rule Checks (Invited Talk),
04, 259--278
Kannan, R., Lovasz, L.:
Covering Minima and Lattice Point Free Convex Bodies,
06, 193--213
Kannan, R., McGeoch, L.A.:
Basis Reduction and Evidence for Transcendence of Certain Numbers,
06, 263--269
Kannan, R.:
Solving Systems of Linear Equations Over Polynomials,
03, 129--144
Kannan, R.:
The Frobenius Problem,
09, 242--251
Kannan, S., see Biswas, S.K.
Kaplan, S.:
Algebraic and Operational Semantics of Positive/Negative Conditional Algebraic Specifications,
08, 419--434
Kapoor, S., see Das, G.
Kapoor, S., Singh, T.:
Dynamic Maintenance of Shortest Path Trees in Simple Polygons,
16, 123--134
Kapur, D., see Mohar, C.K.
Kapur, D., Kusser, D., Narendran, P., Stillman, J.:
Semi-Unification,
08, 435--454
Kapur, D., Narendran, P., Zhang, H.:
Complexity of Sufficient-Completeness,
06, 426--442
Kapur, D., Narendran, P.:
The Knuth Bendix Completion Procedure and Thue Systems,
03, 363--385
Kapur, D., Sivakumar, G., Zhang, H.:
A New Method for Proving Termination of AC-Rewrite Systems,
10, 133--148
Kapur, D., Sivakumar, G.:
Maximal Extensions of Simplification Orderings,
15, 225--239
Kapur, D., Subramaniam, M.:
Using Linear Arithmetic Procedure for Generating Induction Schemes,
14, 438--449
Karhumaki, J.:
Marked Morphisms: A Tool for Solving Problems Concerning Morphisms Over a Binary Alphabet,
02, 106--125
Karnick, H., see Bhatta, K.S.H.S.R.
Kasami, T., see Kaji, Y.
Kasyanov, V.N.:
Annotated Program Transformations,
09, 171--180
Katz, S., see Taubenfeld, G.
Kermani, P., see Gopal, I.S.
Khadilkar, S.N.:
Padding, Commitment and Self-Reducibility,
08, 211--224
Khanna, D., see Vaishnavi, V.K.
Khasidashvili, Z., see Glauert, J.
Khosla, S., Maibaum, T.S.E., Sadler, M.:
Large Database Specifications from Small Views,
05, 246--271
Khuller, S.:
Extending Planar Graph Algorithms to \(K_3,_3\)-free Graphs,
08, 67--79
Kim, S., McNaughton, R.:
Computing the Order of a Locally Testable Automaton,
11, 186--211
Kirchherr, W.W.:
A Hierarchy Theorem for Pram-Based Complexity Classes,
08, 240--249
Kirousis, L.M., see Awerbuch, B.
Kirousis, L.M., see Dendris, N.D.
Klarlund, N., Mukund, M., Sohoni, M.:
Determinizing Buchi Asynchronous Automata,
15, 456--470
Klein, P., see Ravi, R
Knapp, E.:
Soundness and Completeness of UNITY Logic,
14, 378--389
Kobler, J., see Arvind, V.
Koller, D., see Bacchus, F.
Kosaraju, R.S.:
Redistribution of Computations for Improving the Worst-case,
01, 3--8
Kosaraju, S.R.:
On the Parallel Evaluation of Classes of Circuits (Invited Paper),
10, 232--237
Kosaraju, S.R.:
Pattern Matching in Compressed Texts (Preliminary Version),
15, 349--362
Kothari, S.C., see Gannett, E.
Koutny, M., see Janicki, R.
Kowalski, R.A.:
Logic for Knowledge Representation (Keynote Address),
04, 1--12
Kozen, D., Vazirani, U.V., Vazirani, V.V.:
NC Algorithms for Comparability Graphs, Interval Graphs, and Testing for Unique Perfect Matching,
05, 496--503
Kozen, D.:
Efficient Resolution of Singularities of Plane Curves (Invited Talk),
14, 1--11
Kranakis, E., see Awerbuch, B.
Kreveld, M., see Agarwal, P.K.
Krishna Rao, M.R.K.:
Completeness of Hierarchical Combinations of Term Rewriting Systems,
13, 125--138
Krishna, S., see Veni Madhavan, C.E.
Krishnamurthy, E.V.:
Hensel's Methods in Linear Algebraic Computing (Invited Talk),
03, 66--110
Krishnan, S.V., Pandu Rangan, C., Seshadri, S.:
A New Linear Algorithm for the Two Path Problem on Chordal Graphs,
08, 49--66
Krishnaprasad, T., see Verma, R.M.
Krithivasan, K., see Datta, A.
Krithivasan, K., see Mahajan, M.
Krithivasan, K., Das, A.:
Treating Terminals as Function Values of Time,
04, 188--201
Krizanc, D., Narayanan, L., Raman, R.:
Fast Deterministic Selection on Mesh-Connected Processor Arrays,
11, 336--346
Krumke, S.O., see Radhakrishnan, V.
Krznaric, D., Levcopoulos, C.:
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time,
15, 443--455
Kucera, A.:
Regularity is Decidable for Normed PA Processes in Polynomial Time,
16, 111--122
Kudlek, M., see Jantzen, M.
Kudlek, M.:
Indian Parallel Systems,
02, 283--289
Kudlek, M.:
Languages Defined by Context-free Normal Systems,
03, 539--549
Kulkarni, S.R., Mitter, S.K., Richardson, T.J., Tsitsiklis, J.N.:
Local Versus Non-Local Computation of Length of Digitized Curves,
13, 94--103
Kumar, A., Malhotra, V.M.:
A Look-Ahead Interpreter for Sequential Prolog and Its Implementation,
07, 470--484
Kumar, D.:
A Class of Termination Detection Algorithms for Distributed Computations,
05, 73--100
Kumar, M.P., see Nori, K.V.
Kumar, S., see Nori, K.V.
Kumar, S., Malhotra, V.M.:
Automatic Retargetable Code Generation: A New Technique,
06, 57--80
Kumar, V., see Rao, V.N.
Kumar, V., Lin, Y-J.:
A Framework for Intelligent Backtracking in Logic Programs,
06, 108--123
Kundu, S.:
On $O(V)$ Algorithm for Computing Transitive Reduction of a Planar Acyclic Digraph,
01, 39--48
Kunen, K., see Goldsmith, J.
Kusser, D., see Kapur, D.
Kutten, S., see Aggarwal, S.
Kutty, G., see Ramakrishna, Y.S.
Kuty{\lowski, M., Lory{\'s, K.:
Limitations of the QRQW and EREW PRAM Models,
16, 310--321
Kwiatkowska, M.Z.:
Defining Process Fairness for Non-Interleaving Concurrency,
10, 286--300
Lagarias, J.C., Prabhu, N., Reeds, J.A.:
The Parameter Space of the $d$-step Conjecture,
16, 52--63
Lakhneche, Y., see Zwiers, J.
Lakshmanan, K.B., see Ravikumar, B.
Lakshmanan, L.V.S., Nonen, D.A.:
Superfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic Approach,
12, 176--190
Lakshmanan, L.V.S.:
An Epistemic Foundation for Logic Programming with Uncertainty,
14, 89--100
Lakshmanan, V.S., Chandrasekaran, Veni Madhavan, C.E.:
Recognition and Top-Down Generation of $\beta$-Acyclic Database Schemes,
04, 344--366
Lakshmanan, V.S., Veni Madhavan, C.E.:
Binary Decompositions and Acyclic Schemes,
06, 214--238
Lakshmanan, V.S., Veni Madhavan, C.E.:
The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach,
05, 303--328
Lakshmanan, V.S.:
Query Evaluation with Null Values: How Complex is Completeness?,
09, 204--222
Lakshmivarahan, S., Dhall, S.K.:
Parallel Algorithms for Solving Certain Classes of Linear Recurrences,
05, 457--476
Lange, K-J., Niedermeier, R.:
Data-Independences of Parallel Random Access Machines (Extended Abstract),
13, 104--113
Lange, K.-J., see Fernau, H.
Larsen, K.G., see Godskesen, J.C.
Larsen, K.G., see Jensen, F.V.
Lassez, C., see Huynh, T.
Lassez, J-L., see Huynh, T.
Lassez, J-L., Maher, M.J.:
Optimal Fixedpoints of Logic Programs,
03, 343--362
Lassez, J-L., Marriott, K.:
Explicit Representation of Terms Defined by Counter Examples,
06, 96--107
Latteux, M., Leguy, J.:
On the Usefulness of Bifaithful Rational Cones (Text not received),
02,
Laville, A.:
Lazy Pattern Matching in the ML Language,
07, 400--419
Lee, R.C.T., see Fu, J-J.
Leguy, J., see Latteux, M.
Lemieux, F., see Caussinus, H.
Lermer, K., see Baumann, P.
Levcopoulos, C., see Krznaric, D.
Levcopoulos, C., Gudmundsson, J.:
Close Approximations of Minimum Rectangular Coverings,
16, 135--146
Levcopoulos, C., Lingas, A., Petersson, O., Rytter, W.:
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplaner Graphs,
10, 204--214
Levcopoulos, C., Lingas, A., Wang, C.:
On Parallel Complexity of Planar Triangulations,
15, 413--427
Levcopoulos, C., Lingas, A.:
Bounds on the Length of Convex Partitions of Polygons,
04, 279--295
Levcopoulos, C., Lingas, A.:
C-Sensitive Triangulations Approximate the Min Max Length Triangulation,
12, 104--115
Levcopoulos, C., Petersson, O.:
An Optimal Parallel Algorithm for Sorting Presorted Files,
08, 154--160
Levcopoulos, C.:
Improved Bounds for Covering General Polygons with Rectangles,
07, 95--102
Lewington, C.P.:
Towards Constructive Program Derivation in VDM,
10, 115--132
Lin, R., Olariu, S.:
Fast Parallel Algorithms for Cographs,
10, 176--189
Lin, Y-J., see Kumar, V.
Lingas, A., see Levcopoulos, C.
Lingas, A., Proskurowski, A.:
Fast Parallel Algorithms for the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs,
07, 79--94
Linna, M., see Culik II, K.
Linnestad, H., Prehofer, C., Lysne, O.:
Higher-Order Proof by Consistency,
16, 274--285
Lodaya, K., Ramanujam, R.:
Tense Logics for Local Reasoning in Distributed Systems,
11, 71--88
Loke, R.K.S., see Oommen, B.J.
Lory{\'s, K., see Kuty{\lowski, M.
Lovasz, L., see Kannan, R.
Lovasz, L.:
Connectivity Algorithms Using Rubber Bands (Invited Talk),
06, 394--411
Lovengreen, H.H., see Gronning, P.
Lowe, M., see Ehrig, H.
Luckham, D.C., see Rosenblum, D.S.
Lysne, O., see Linnestad, H.
Madhavji, N.H., see Desharnais, J.
Maessen, J.-W., see Arvind
Mahadevan, S., Shyamasundar, R.K.:
On the Fairness of Distributed Programs,
02, 171--191
Mahajan, M., Krithivasan, K.:
Relativised Cellular Automata and Complexity Classes (Extended Abstract),
11, 172--185
Mahajan, M., Vinay, V.:
Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract),
14, 48--59
Mahanti, A., see Bagchi, A.
Maher, M.J., see Lassez, J-L.
Maher, M.J.:
A Transformation System for Deductive Database Modules with Perfect Model Semantics,
09, 89--98
Maheshwari, A., see Arikati, S.R.
Maheshwari, A., see Ghosh, S.K.
Maheshwari, S.N., see Cheriyan, J.
Maheshwari, S.N., see Dublish, P.
Maheshwari, S.N., see Murthy, B.N.S.
Maheshwari, S.N., see Nath, D.
Maheshwari, S.N., Sethi, P.S.:
A Dynamic - Programming - Based Polynomial - Time Algorithm,
03, 550--574
Maibaum, T.S.E., see Khosla, S.
Maibaum, T.S.E., Sadler, M.R., Veloso, P.A.S.:
Logical Specification and Implementation,
04, 13--30
Maler, O., see Asarin, E.
Malhotra, V.M., see Kumar, A.
Malhotra, V.M., see Kumar, S.
Malhotra, V.M., see Sanyal, A.
Mamrak, S.A.:
Installing Existing Tools in a Distributed Processing Environment,
01, 49--56
Mandrioli, D., see Ghezzi, C,
Manna, Z., see Browne, I.A.
Manna, Z., Waldinger, R.:
Deduction with Relation Matching (Invited Talk),
05, 212--224
Mannila, H., see Back, R.J.R.
Mansour, Y., Park, J.K., Schieber, B., Sen, S.:
Improved Selection in Totally Monotone Arrays,
11, 347--359
Marathe, M.V., see Hunt III, H.B.
Marathe, M.V., see Radhakrishnan, V.
Marchetti-Spaccamela, A., see Frigioni, D.
Marchetti-Spaccamela, A.:
New Protocols for the Election of a Leader in a Ring,
05, 101--115
Marriott, K., see Lassez, J-L.
Martel, C., Subramonian, R.:
On the Complexity of Certified Write All Algorithms,
12, 368--379
Masseron, M., Tollu, C., Vauzeilles, J.:
Generating Plans in Linear Logic,
10, 63--75
Mata, J.M., Vijayan, G.:
Design and Implementation of a Procedural VLSI Layout System,
05, 412--427
Matthews, S., see Basin, D.
Mauny, M., see Sayag, E.
Mayr, R.:
Weak Bisimulation and Model Checking for Basic Parallel Processes,
16, 87--99
McDowell, E., see Jiang, T.
McGeoch, L.A., see Kannan, R.
McNaughton, R., see Kim, S.
Mehlhorn, K., see Dubhashi, D.P.
Mehlhorn, K.:
Recent Developments in Algorithms for the Maximum-Flow Problem (Invited Talk) (Text not received),
12, 404
Mehndiratta, S.L., see Ramesh, S.
Mehndiratta, S.L., see Viswanathan, H.
Mehndiratta, S.L., see Yavatkar, R.S.
Melliar-Smith, P.M., see Ramakrishna, Y.S.
van der Meyden, R.:
Finite State Implementations of Knowledge-Based Programs,
16, 262--273
Misra, J., see Chandy, K.M.
Mitra, P., Nandy, S.C.:
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles,
16, 75--87
Mitra, S., see Dershowitz, N.
Mitra, S., Sivakumar, G.:
AC-Equation Solving,
11, 40--56
Mittal, S., Chandrasekaran, B.:
Software Design of Knowledge Directed Database Systems,
01, 87--98
Mitter, S.K., see Kulkarni, S.R.
Modigliani, U., see Aguzzi, G.
Mohanty, H., Bhattacharjee, G.P.:
A Distributed Algorithm for Edge-Disjoint Path Problem,
06, 344--361
Mohar, C.K., Srivas, M.K., Kapur, D.:
Reasoning in Systems of Equations and Inequations,
07, 305--325
Moitra, A., see Joseph, M.
Moitra, A.:
Relation Between Algebraic Specifications and Turing Machines,
01, 241--249
Moitra, A.:
Scheduling of Hard Real-Time Systems,
06, 362--381
Monier, L., see Chazelle, B.
Monsuez, B.:
Polymorphic Typing by Abstract Interpretation,
12, 217--228
Moran, S., see Taubenfeld, G.
Morin, T.L., Prabhu, N., Zhang, Z.:
Complexity of the Gravitational Method for Linear Programming,
16, 212--223
Morrison, R., see Atkinson, M.P.
Moser, L.E., see Ramakrishna, Y.S.
Mukhopadhyay, A., see Jadhav, S.
Mukund, M., see Klarlund, N.
Mukund, M., Nielsen, M.:
CCS, Locations and Asynchronous Transition Systems,
12, 328--341
Mukund, M., Sohoni, M.:
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice,
13, 388--399
Mukund, M., Thiagarajan, P.S.:
An Axiomatization of Event Structures,
09, 143--160
Muller, D.E., see Saoudi, A.
Mulmuley, K.:
A Lower Bound for Solvability of Polynomial Equations (Invited Talk),
13, 268--283
Mundhenk, M., see Arvind, V.
Munro, J.I., Raman, V.:
Fast Stable In-Place Sorting with O(n) Data Moves,
11, 266--277
Munro, J.I., Raman, V.:
Selection From Read-Only Memory and Sorting with Optimum Data Movement,
12, 380--391
Munro, J.I.:
Tables (Invited Talk),
16, 37--42
Muralidharan, M.N., Sahasrabuddhe, H.V.:
Permutation Algorithms: A Case Study in Algorithm Schema Transformation,
01, 251--259
Murthy, B.N.S., Maheshwari, S.N.:
Optimization of a Class of Relational Expressions,
02, 33--54
Murthy, Y.D., Bhattacharjee, G.P., Seetaramanath, M.N.:
Time - And Space - Optimal Height-Balanced 2--3 Brother Trees,
02, 400--421
Muthukrishnan, S., Ramesh, H.:
String Matching Under a General Matching Relation,
12, 356--367
Myers, T.J., Cohen, A.T.:
Models and Transformations for Nondeterministic Extensions of Functional Programming,
04, 60--88
Nagaraja, G., see Bhattacharyya, P.
Naish, L.:
Specification = Program + Types,
07, 326--339
Nakamura, A., Aizawa, K.:
On a Relationship Between Graph L-Systems and Picture Languages,
01, 261--280
Nambiar, K.K., Radhakrishnan, T.:
A Study of Saturated Sets and Functional Dependencies in Relational Databases using Linear Graphs,
01, 99--107
Nandy, S.C., see Mitra, P.
Nandy, S.C., Bhattacharya, B.B., Ray, S.:
Efficient Algorithms for Identifying all Maximal Isothetic Empty Rectangles in VLSI Layout Design,
10, 255--269
Nandy, S.C., Sinha, A., Bhattacharya, B.B.:
Location of the Largest Empty Rectangle Among Arbitrary Obstacles,
14, 159--170
Nanni, U., see Frigioni, D.
Narasimhan, R. (Moderator):
Panel on Software Technology: Integrating Theory and Practice,
13, 317
Narayan Kumar, K., Pandya, P.K.:
ICSP and Its Relationship with ACSP and CSP,
13, 358--372
Narayan Kumar, K., Pandya, P.K.:
On the Computational Power of Operators in ICSP with Fairness,
14, 231--242
Narayana, K.T., Clint, M.:
On the Completeness of a Proof System for a Synchronous Parallel Programming Language,
03, 225--257
Narayanan, H., see Patkar, S.
Narayanan, L., see Krizanc, D.
Narayanan, N.H., see Chandrasekaran, B.
Narendran, P., see Kapur, D.
Natarajan, N.:
A Distributed Algorithm for Detecting Communication Deadlocks,
04, 119--135
Natarajan, N.:
Program Structures for Decentralized Algorithms,
01, 57--66
Natarajan, V., Christoff, I., Christoff, L., Cleaveland, R.:
Priority and Abstraction in Process Algebra,
14, 217--230
Nath, D., Maheshwari, S.N., Bhatt, P.C.P.:
Efficient VLSI Networks for Parallel Processing based on Orthogonal Trees (Extended Abstract),
01, 201--216
Nicola, R.D., Ferrari, G.L.:
Observational Logics and Concurrency Models,
10, 301--315
Niedermeier, R., see Lange, K-J.
Nielsen, M., see Mukund, M.
Nielsen, M., Cheng, A.:
Observing Behaviour Categorically (Invited Talk),
15, 263--278
Nielsen, M., Thiagarajan, P.S.:
Degrees of Non-Determinism and Concurrency: A Petri Net View (Invited Talk),
04, 89--118
Nielsen, T.Q., see Gronning, P.
Nielson, D.:
Hierarchical Refinement of A Z Specification,
07, 376--399
Nielson, F.:
Towards Viewing Nondeterminism as Abstract Interpretation,
03, 20--39
Nielson, H.R.:
Proof Systems for Computation Time,
03, 258--273
Niepel, I., Rossmanith, P.:
Uniform Circuits and Exclusive Read PRAMs,
11, 307--318
Nikhil, S., see Arvind
Nipkow, T., see Broy, M.
Nipkow, T.:
Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook,
16, 180--192
Nivat, M.:
Minimal Ascending and Descending Tree Automata (Invited Talk) (Text not received),
08,
Nivat, M.:
Theory and Practice in Programming (Keynote Address) (Text not received),
01, 1--2
Nonen, D.A., see Lakshmanan, L.V.S.
Nori, K.V., Kumar, S., Kumar, M.P.:
Retrospection on the PQCC Compiler Structure,
07, 500--527
Norvell, T.S.:
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming,
13, 294--305
Odersky, M.:
Polarized Name Passing,
15, 324--337
Ogunyode, O.A.:
Parallel Algorithms for Approximate Edge Colouring of Simple Graphs,
07, 207--225
Olariu, S., see Jamison, B.
Olariu, S., see Lin, R.
Oommen, B.J., Loke, R.K.S.:
Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors,
16, 224--237
Overmars, M., see Asberg, B.
Pal, A.K., Bagchi, A.:
Analysis of a Simple Insertion Algorithm for 3 - trees,
03, 390--417
Pal, A.K., Bagchi, A.:
On the Mean Weight Balance Factor of Binary Trees,
04, 419--434
Pal, S.P., see Biswas, S.
Pal, S.P., see Ghosh, S.K.
Palsberg, J., see Cheng, A.
Pan, V., Reif, J.:
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems,
06, 470--487
Pan, V.:
Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices,
05, 504--521
Pan, V.:
Trilinear Aggregating is the Basis for the Asymptotically Fastest Known Algorithms for Matrix Multiplication,
02, 321--337
Panangaden, P., Shanbhogue, V.:
McCarthy's Amb Cannot Implement Fair Merge,
08, 348--363
Panangaden, P.:
The Expressive Power of Indeterminate Primitives in Asynchronous Computation (Invited Talk),
15, 124--150
Panconest, A., see Arbib, C.
Pandu Rangan, C., see Krishnan, S.V.
Pandu Rangan, C., see Srinivasa Rao, A.
Pandya, P.K., see Narayan Kumar, K.
Pantziou, G., Spirakis, P., Zaroliagis, C.:
Fast Parallel Approximations of the Maximum Weighted Cut Problem Through Derandomization,
09, 20--29
Papadimitriou, C.H., Rangan, V., Sideri, M.:
Designing Secure Communication Protocols From Trust Specifications,
11, 360--368
Papaditmitriou, C.H.:
Shortest-Path Motion (Invited Talk),
06, 144--153
Parigot, M.:
Automata, Games and Positive Monadic Theories of Trees,
07, 44--57
Parikh, R.:
Logics of Knowledge, Games and Dynamic Logic (Invited Talk),
04, 202--222
Parikh, R.:
Models for Programs,
01, 109--120
Parikh, R.:
Some Recent Applications of Knowledge (Invited Talk),
07, 528--539
Park, J.K., see Mansour, Y.
Parrow, J.:
Submodule Construction as Equation Solving in CCS,
07, 103--123
Paschos, V.T.:
A Theorem on the Approximation of Set Cover and Vertex Cover,
11, 278--287
Paterson, M., Tassa, S., Zwick, U.:
Looking for MUM and DAD: Text-Text Comparisons Do Help (Invited Talk),
15, 1--10
Patkar, S., Narayanan, H.:
A Fast Algorithm for the Principal Partition of a Graph,
11, 288--306
Patkar, S., Narayanan, H.:
Fast Sequential and Randomized Parallel Algorithms for Rigidity and Approximate Min k-cut,
12, 265--278
Patnaik, L.M., see Goswami, A.K.
Patnaik, L.M., see Hansdah, R.C.
Pawag, S., see Sherlekar, D.D.
Pearson, D., Vazirani, V.:
A Fast Parallel Algorithm for Finding a Maximal Bipartite Set,
10, 225--231
Perrott, R.H.:
Synchronous Parallel Programming Languages,
01, 121--133
Petersson, O., see Levcopoulos, C.
Petrone, L.:
Reusing Batch Parsers as Incremental Parsers,
15, 111--123
Pettorossi, A.:
Program Development Using Lambda Abstraction,
07, 420--434
Pin, J-E., see Antoine, C.
Pin, J.E., see Saec, B.
Pingali, K., Ekanadham, K.:
Accumulators: New Logic Variable Abstractions for Functional Languages,
08, 377--399
Pnueli, A., see Apt, K.R.
Pnueli, A.:
System Specification and Refinement in Temporal Logic (Invited Talk),
12, 1--38
Poizat, B.:
Generic Oracles (Text not received),
04, 380
Prabhakar, T.V., see Sahasrabuddhe, H.V.
Prabhu, N., see Lagarias, J.C.
Prabhu, N., see Morin, T.L.
Pramanik, S., Vineyard, D.:
Optimizing Join Queries in Distributed Databases,
07, 282--304
Prasad, D.C., see Biswas, S.
Prasad, S., see Amadio, R.M.
Prasad, S., see Das, S.K.
Prasad, V.C., see Saxena, S.
Prasad, V.R.:
Strong Synchronization of Communicating Processes,
03, 202--224
Prehofer, C., see Broy, M.
Prehofer, C., see Linnestad, H.
Preparata, F.P.:
Planar Point Location Revisited (A Guided Tour of a Decade of Research (Invited Talk),
08, 1--17
Proskurowski, A., see Lingas, A.
Protasi, M., see Gambosi, G.
Pruhs, K., see Kalyanasundaram, B.
Pujari, A.K.:
Efficient Algorithm to Sort Linear Combinations of Arrays,
13, 411--418
Purushothaman, S., see Rajopadhye, S.V.
Quinn, M.J., Deo, N.:
An Upper Bound for the Speedup of Parallel Branch-And-Bound Algorithms,
03, 488--504
Radhakrishnan, J., see Halldorsson, M.M.
Radhakrishnan, T., see Nambiar, K.K.
Radhakrishnan, V., see Hunt III, H.B.
Radhakrishnan, V., Krumke, S.O., Marathe, M.V., Rosenkrantz, D.J., Ravi, S.S.:
Compact Location Problems (Extended Abstract),
13, 238--247
Radola, M-D., see Dessel, J.
Raghavachari, B., see Furer, M.
Raghavachari, B., see Ravi, R
Raghavan, P.:
Randomized Approximation Algorithms in Combinatorial Optimization (Invited Talk),
14, 300--317
Rajan, D.S., see Case, J.
Rajasekaran, S., Tsantilas, T.:
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks,
07, 226--241
Rajasekaran, S.:
Randomized Parallel Selection (Extended Abstract),
10, 215--224
Rajasethupathy, K.S.:
A Parsing Algorithm for Node Replacement Parallel Graph Grammars,
01, 299--308
Rajkumar, V., see Siromoney, R.
Rajopadhye, S.V., Purushothaman, S., Fujimoto, R.M.:
On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies,
06, 488--503
Ramachandran, V., Hentenryck, P.V.:
Incremental Algorithms for Constraint Solving and Entailment Over Rational Trees,
13, 205--217
Ramakrishna, Y.S., Dillon, L.K., Moser, L.E., Melliar-Smith, P.M., Kutty, G.:
A Real-Time Interval Logic and Its Decision Procedure,
13, 173--192
Ramakrishna, Y.S., Dillon, L.K., Moser, L.E., Melliar-Smith, P.M., Kutty, G.:
An Automata-Theoretic Decision Procedure for Future Interval Logic,
12, 51--67
Ramakrishnan, I.V., see Ramesh, R.
Ramakrishnan, I.V., see Sherlekar, D.D.
Ramakrishnan, I.V., see Verma, R.M.
Ramakrishnan, I.V., Varman, P.J.:
On Mapping Cube Graphs onto VLSI Arrays,
04, 296--316
Raman, R., see Krizanc, D.
Raman, R.:
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting,
10, 161--175
Raman, V., see Balasubramanian, R.
Raman, V., see Munro, J.I.
Ramanan, P., Tsuga, K.:
Average-Case Analysis of the Modified Harmonic Algorithm,
06, 177--192
Ramanujam, R., see Lodaya, K.
Ramanujam, R., Shyamasundar, R.K.:
Process Specification of Logic Programs,
04, 31--43
Ramanujam, R.:
Semantics of Distributed Horn Clause Programs,
07, 361--371
Ramanujam, R.:
Trace Consistency and Inevitability,
16, 250--261
Ramesh, H., see Muthukrishnan, S.
Ramesh, R., Ramakrishnan, I.V., Sekar, R.C.:
Automata-Driven Efficient Subterm Unification,
14, 288--299
Ramesh, S., Mehndiratta, S.L.:
A New Class of High Level Programs for Distributed Computing Systems,
05, 42--72
Ramkumar, G.D.S., see Datta, A.
Rangan, V., see Papadimitriou, C.H.
Ranjan, D., see Dubhashi, D.P.
Rao, T.R.N., Delcambre, M.L., Iskander, A.:
Cyclic Codes and Finite Field Arithmetic,
01, 179--186
Rao, V.N., Kumar, V.:
Superlinear Speedup in Parallel State-Space Search,
08, 161--174
Ravi, R, Raghavachari, B., Klein, P.:
Approximation Through Local Optimality: Designing Networks with Small Degree,
12, 279--290
Ravi, S.S., see Hunt III, H.B.
Ravi, S.S., see Radhakrishnan, V.
Ravikumar, B., see Ibarra, O.H.
Ravikumar, B., see Jiang, T.
Ravikumar, B., Lakshmanan, K.B.:
Coping with Known Patterns of Lies in a Search Game,
02, 363--377
Ravikumar, B.:
Some Observations on 2-Way Probabilistic Finite Automata,
12, 392--403
Ravikumar, S., Sivakumar, D.:
On Self-Testing Without the Generator Bottleneck,
15, 248--262
Ray, S., see Nandy, S.C.
Raynal, M., Schiper, A.:
From Causal Consistency to Sequential Consistency in Shared Memory Systems,
15, 180--194
Reeds, J.A., see Lagarias, J.C.
Reggio, G.:
A Non-Standard Inductive Semantics,
10, 362--372
Regnier, M.:
Grid File Algorithms: An Analysis in the Biased Case,
04, 393--418
Reif, J., see Pan, V.
Reif, J., Tyagi, A.:
Efficient Parallel Algorithms for Optical Computing with the DFT Primitive,
10, 149--160
Reif, W., Stenzel, K.:
Reuse of Proofs in Software Verification,
13, 284--293
Reif, W.:
Verification of Large Software Systems,
12, 241--252
Reinhardt, K., see Fernau, H.
Rich, C.A., Slutzki, G.:
The Complexity of a Counting Finite-State Automation,
08, 225--239
Richardson, T.J., see Kulkarni, S.R.
de Roever, W.P., see Gerth, R.
de Roever, W.P., see Zwiers, J.
Roncken, M., see Gerth, R.
Rosenblum, D.S., Sankar, S., Luckham, D.C.:
Concurrent Runtime Checking of Annotated Ada Programs,
06, 10--35
Rosenfeld, A.:
Image Understanding: Past, Present, and Future (Invited Lecture) (Text not received),
10, 421
Rosenkrantz, D.J., see Hunt III, H.B.
Rosenkrantz, D.J., see Radhakrishnan, V.
Rossello, F., see Cucker, F.
Rossi, F., see Codognet, P.
Rossmanith, P., see Niepel, I.
Roychoudhury, A., Sur-Kolay, S.:
Efficient Algorithms for Vertex Arboricity of Planar Graphs,
15, 37--51
Rushby, J.:
Mechanized Formal Methods: Progress and Prospects (Invited Talk),
16, 43--51
Rytter, W., see Levcopoulos, C.
Sadler, M., see Khosla, S.
Sadler, M.R., see Maibaum, T.S.E.
Saec, B., Pin, J.E., Weil, P.:
A Purely Algebraic Proof of McNaughton' Theorem on Infinite Words,
11, 141--151
Sahasrabuddhe, H.V., see Jajoo, B.H.
Sahasrabuddhe, H.V., see Muralidharan, M.N.
Sahasrabuddhe, H.V., Prabhakar, T.V.:
B_S-Trees,
03, 438--453
Sahni, S., see Bhasker, J.
Sahni, S., see Cheng, K.H.
Sahni, S., see Kane, R.
Saluja, S., see Ghosh, S.K.
Sands, D.:
Time Analysis, Cost Equivalence and Program Refinement,
11, 25--39
Sangal, R., see Bharati, A.
Sangal, R., see Srinivas, Y.P.
Sankar, S., see Rosenblum, D.S.
Santha, M.:
Relativized Artur-Merlin versus Merlin-Artur Games,
07, 435--442
Santis, F.de., Sessa, M.I.:
On Some Computational Problems Related to Data Base Coding (Text not received),
04, 379
Santosh, V., see Arora, V.
Sanyal, A., see Gandhe, M.
Sanyal, A., Biswas, S, Malhotra, V.M.:
Extension of Weakest Precondition Formalism to a Low Level Language,
07 , 485--499
Saoudi, A., Muller, D.E., Schupp, P.E.:
Recognisable Infinite Tree Sets and Their Complexity,
10, 91--103
Saran, H., see Arora, V.
Saraswat, V.A.:
Partial Correctness Semantics for CP$[\downarrow, \mid, \&]$,
05, 347--368
Sastry, P.N., Jayakumar, N., Veni Madhavan, C.E.:
Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs,
07, 65--78
Savicky, P., Wegener, I.:
Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams,
14, 390--401
Saxena, S., Bhatt, P.C.P., Prasad, V.C.:
On Parallel Sorting and Addition with Concurrent Writes,
08, 143--153
Sayag, E., Mauny, M.:
Characterization of Principal Type of Normal Forms in an Intersection Type System,
16, 335--346
Schieber, B., see Mansour, Y.
Schieder, B., see Broy, M.
Schiper, A., see Raynal, M.
Schomer, E., see Follert, F.
Schuler, R., Yamakami, T.:
Structural Average Case Complexity (Preliminary Report),
12, 128--139
Schuler, R.:
Average Polynomial Time is Hard for Exponential Time Under sn-Reductions,
15, 240--247
Schupp, P.E., see Saoudi, A.
Seetaramanath, M.N., see Murthy, Y.D.
Sekar, R.C., see Ramesh, R.
Sellen, J., see Follert, F.
Sen, S., see Mansour, Y.
Sen, S.:
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems,
14, 193--204
Sengupta, R., Venkateswaran, H.:
Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits,
16, 298--309
Sernadas, A., see Fiadeiro, J.
Sernadas, C., see Fiadeiro, J.
Seshadri, S., see Krishnan, S.V.
Sessa, M.I., see Santis, F.de.
Sethi, P.S., see Maheshwari, S.N.
Shanbhogue, V., see Panangaden, P.
Sharma, A., see Case, J.
Shende, A.M., see Case, J.
Shepherd, J., see Gibert, J.
Sherlekar, D.D., Pawag, S., Ramakrishnan, I.V.:
O(1) Parallel Time Incremental Graph Algorithms,
05, 477--495
Shira, L., see Gerth, R.
Shmoys, D.B., see Hochbaum, D.S.
Shyamasundar, R.K., see Mahadevan, S.
Shyamasundar, R.K., see Ramanujam, R.
Shyamasundar, R.K.:
On the Impossibility of Infix to Prefix Translation by a Pushdown Machine,
01, 21--27
Sideri, M., see Papadimitriou, C.H.
Sieber, K.:
Relating Full Abstraction Results for Different Programming Languages,
10, 373--387
Siegel, M., Stomp, F.A.:
Extending the Limits of Sequentially Phased Reasoning (Extended Abstract),
14, 402--413
Sikdar, K.:
On the Complexity Classes and Optimal Algorithms for Parallel Evaluation of Polynomials,
01, 29--38
Silberschatz, A., see Buckley, G.N.
Singh, T., see Kapoor, S.
Sinha, A., see Nandy, S.C.
Sinha, B.P., see Bhattacharya, B.B.
Sinha, M.K., see Viswanathan, H.
Sinha, M.K., see Yavatkar, R.S.
Sinha, M.K.:
Approximate Transactions: A Methodology for Solving a Class of Database Problems,
01, 67--74
Sipma, H.B., see Browne, I.A.
Siromoney, G., see Siromoney, R.
Siromoney, G., Subramanian, K.G., Siromoney, R.:
A Map Generating System,
03, 145--170
Siromoney, R., see Siromoney, G.
Siromoney, R., see Subramanian, K.G.
Siromoney, R., Dare, V.R., Subramanian, K.G.:
On Infinite Arrays Obtained by Controlled Deterministic Table L-Array Systems,
02, 290--306
Siromoney, R., Dare, V.R.:
A Generalization of the Parikh Vector for Finite and Infinite Words,
05, 290--302
Siromoney, R., Rajkumar, V., Subramanian, K.G.:
Infinite Arrays and Infinite Computations,
01, 281--285
Siromoney, R., Siromoney, G., Subramanian, K.G.:
Extended Table Matrix Grammars (Text not received),
01, 297--298
Sivakumar, D., see Ravikumar, S.
Sivakumar, G., see Kapur, D.
Sivakumar, G., see Mitra, S.
Slutzki, G., see Rich, C.A.
Smetsers, S., see Barendsen, E.
Smid, M., see Das, G.
Smid, M., see Follert, F.
Smolka, S.A., see Debray, S.K.
Sohoni, M., see Klarlund, N.
Sohoni, M., see Mukund, M.
Soundararajan, N.:
Correctness Proofs of CSP Programs,
01, 135--142
Spirakis, P., see Pantziou, G.
Sreenivasa Kumar, P., Veni Madhavan, C.E.:
A New Class of Separators and Planarity of Chordal Graphs,
09, 30--43
Sridhar, S.:
An Implementation of Obj2: An Object-Oriented Language for Abstract Program Specification,
06, 81--95
Srimani, P.K., see Bagchi, A.
Srimani, P.K., see Bhattacharya, B.B.
Srinivas, Y.P., Sangal, R.:
A Generalization of Backus FP,
06, 124--143
Srinivasa Rao, A., Pandu Rangan, C.:
Optimal Parallel Algorithms on Circular-Arc Graphs,
09, 44--55
Srivas, M, see Hsiang, J.
Srivas, M.K., see Mohar, C.K.
Srivastava, A.:
Recovery of Noncurrent Variables in Source-level Debugging of Optimized Code,
06, 36--56
Stamatiou, Y.C., see Dendris, N.D.
Stark, E.W.:
A Proof Technique for Rely/Guarantee Properties,
05, 369--391
Stavi, J., see Apt, K.R.
Stearns, R.E., see Hunt III, H.B.
Steinbach, J.:
Proving Polynomials Positive,
12, 191--202
Steinberg, P., see Bonomi, F.
Stenzel, K., see Reif, W.
Stewart, I.A.:
An Algorithm for Colouring Perfect Planar Graphs,
07, 58--64
Stewart, I.A.:
Complete Problems Involving Boolean Labelled Structures and Projection Translations,
11, 242--260
Stillman, J., see Kapur, D.
Stirling, C.:
A Proof Theoretic Characterization of Observational Equivalence,
03, 274--289
Stomp, F.A., see Siegel, M.
Stoy, J., see Arvind
Street, R.S.:
Global Process Logic is Undecidable,
02, 96--105
Stuckey, P.J., Sudarshan, S.:
Well-Founded Ordered Search (Extended Abstract),
13, 161--172
Studer, R.:
Abstraction Concepts for Modeling Screen Oriented Dialogue Interfaces,
04, 241--258
Subrahmanian, V.S., see Blair, H.A.
Subrahmanian, V.S.:
Algebraic Properties of the Space of Multivalued and Paraconsistent Logic Programs,
09, 56--67
Subrahmanyam, K.V., see Halldorsson, M.M.
Subrahmanyam, R.:
Complexity of Algebraic Specifications,
10, 33--47
Subramaniam, M., see Kapur, D.
Subramanian, A.:
An Explanation of Splaying,
14, 354--365
Subramanian, C.R., Veni Madhavan, C.E.:
Coloring Semi-Random Graphs in Polynomial Expected Time,
14, 137--148
Subramanian, K.G., see Siromoney, G.
Subramanian, K.G., see Siromoney, R.
Subramanian, K.G., Van, D.L., Siromoney, R.:
On Ambiguity of DTOL Systems,
07, 3--14
Subramonian, R., see Martel, C.
Sudarshan, S., see Stuckey, P.J.
Sudarshanam, A., see Yavatkar, R.S.
Sundararajan, R., Conery, J.S.:
An Abstract Interpretation Scheme for Groundness, Freeness, and Sharing Analysis of Logic Programs,
12, 203--216
Sur-Kolay, S., see Roychoudhury, A.
Sur-Kolay, S, Bhattacharya, B.B.:
Inherent Nonslicibility of Rectangular Duals in VLSI Floorplanning,
08, 88--107
Suzuki, I., see Guha, S.
Sondergaard, H.:
Immediate Fixpoints and Their Use in Groundness Analysis,
16, 359--370
Takanami, I., see Toda, M.
Talamo, M., see Gambosi, G.
Tan Q-P., Chen, H-W.:
On the Operational Interpretation of Complex Types,
11, 57--70
Tassa, S., see Paterson, M.
Taubenfeld, G., Francez, N.:
Proof Rules for Communication Abstractions,
04, 443--465
Taubenfeld, G., Katz, S., Moran, S.:
Impossibility Results in the Presence of Multiple Faulty Processes,
09, 109--120
Tecchio, A., see Ghezzi, C,
Thiagarajan, P.S., see Mukund, M.
Thiagarajan, P.S., see Nielsen, M.
Thiel, C., see Dubhashi, D.P.
Thiel, C., see Follert, F.
Thierauf, T., see Agrawal, M.
Thilikos, D.M., see Dendris, N.D.
Thomas, W.:
Finite-State Strategies in Regular Infinite Games (Invited Talk),
14, 149--158
Tiuryn, J.:
Equational Axiomatization of Bicoercibility for Polymorphic Types,
15, 166--179
Toda, M., Inoue, K., Takanami, I.:
Two-dimensional Pattern Matching by Two-dimensional On-line Tessellation Acceptors,
01, 153--166
Tollu, C., see Masseron, M.
Tomita, S., see Kanaoka, T.
Tomlinson, I.T., Garg, V.K.:
Observation of Software for Distributed Systems with RCL,
15, 195--209
Toussaint, G., see Asberg, B.
Treinen, R.:
A New Method for Undecidability Proofs of First Order Theories,
10, 48--62
Trevisan, L., see Boreale, M.
Trevisan, L., see Crescenzi, P.
Tsantilas, T., see Rajasekaran, S.
Tsitsiklis, J.N., see Kulkarni, S.R.
Tsuga, K., see Ramanan, P.
Tsuiki, H.:
On Typed Calculi with a Merge Operator,
14, 101--112
Turner, R., see Henson, M.C.
Tyagi, A., see Reif, J.
Tyagi, A.:
Energy-Time Trade-Offs in VLSI Computations,
09, 301--311
Ueda, K., see Furukawa, K.
Usharani, N., see Diwan, A.A.
Vaishnavi, V.K., Khanna, D.:
A Simple File Structure for the Weighted Dictionary Problem,
13, 419--435
Vaishnavi, V.K.:
How to Balance a Multidimensional Search Tree,
03, 418--437
Van, D.L., see Subramanian, K.G.
Varman, P.J., see Ramakrishnan, I.V.
Varman, P.J., Verma, R.M.:
Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems,
16, 200--211
Vauzeilles, J., see Masseron, M.
Vazirani, U.V., see Kozen, D.
Vazirani, U.V., Vazirani, V.V.:
Sampling a Population with a Semi-random Source,
06, 443--452
Vazirani, V., see Pearson, D.
Vazirani, V.V., see Arora, V.
Vazirani, V.V., see Vazirani, U.V.
Veenstra, J., Ahuja, N.:
Deriving Object Octree from Images,
05, 196--211
Veloso, P.A.S., see Maibaum, T.S.E.
Veni Madhavan, C.E., see Ghosh, S.K.
Veni Madhavan, C.E., see Lakshmanan, V.S.
Veni Madhavan, C.E., see Sastry, P.N.
Veni Madhavan, C.E., see Sreenivasa Kumar, P.
Veni Madhavan, C.E., see Subramanian, C.R.
Veni Madhavan, C.E., Krishna, S.:
Efficient Secondary Attribute Retrieval Using Tree Data Structures,
02, 19--32
Veni Madhavan, C.E.:
Approximation Algorithm for Maximum Independent Set in Planar Triangle-Free Graphs,
04, 381--392
Venkatesan, S., see Juang, J.T-Y.
Venkatesan, S.M.:
Approximation Algorithms for Planar Matching,
05, 162--175
Venkatesh, G., see Gandhe, M.
Venkatesh, G.:
A Decision Method for Temporal Logic Based on Resolution,
05, 272--289
Venkateswaran, H., see Sengupta, R.
Venkateswaran, H.:
Circuit Definitions of Nondeterministic Complexity Classes,
08, 175--192
Verma, R.M., see Varman, P.J.
Verma, R.M., Krishnaprasad, T., Ramakrishnan, I.V.:
An Efficient Parallel Algorithm for Term Matching,
06, 504--518
Vidyasankar, K.:
A Simple Characterization of Database Serializability,
05, 329--345
Vijayan, G., see Mata, J.M.
Vijayaraman, T.M., see Irani, A.
Vinay, V., see Hooker, J.N.
Vinay, V., see Mahajan, M.
Vinay, V., Chandru, V.:
The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata,
10, 104--114
Vinay, V.:
Is BP.$\bigoplus$P a Probabilistic Class?,
11, 261--265
Vineyard, D., see Pramanik, S.
Viswanathan, H., Mehndiratta, S.L., Sinha, M.K., Abraham, J.:
Recovery Manager for the Multi-node File Server ``Sanchay",
03, 386--387
Vitanyi, P.M.B., see Awerbuch, B.
Waldecker, B., see Garg, V.K.
Waldinger, R., see Manna, Z.
Wang, C., see Levcopoulos, C.
Wang, H., see Ibarra, O.H.
Wegener, I., see Savicky, P.
Weil, P., see Saec, B.
Wilfong, G., see Asberg, B.
Winskel, G.:
A Complete Proof System for SCCS with Model Assertions,
05, 392--410
Winskel, G.:
Petri Nets and Transition Systems (Invited Talk) (Text not received),
11, 420
Wood, D., see Estivill-Castro, V.
Yamakami, T., see Schuler, R.
Yavatkar, R.S., Sudarshanam, A., Mehndiratta, S.L., Sinha, M.K.:
Sanchay: A Multi-node File Server for a Local Area Network,
02, 256--276
Yen, H-C., see Gannett, E.
Yi, W., Jonsson, B.:
Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes,
14, 243--255
Yoshida, N., see Honda, K.
Yoshida, N.:
Graph Types for Monadic Mobile Processes,
16, 371--386
You, J-H., see Yuan, L.Y.
Yuan, L.Y., You, J-H.:
Discriminant Circumscription,
10, 21--32
Zachos, S., Furer, M.:
Probabilistic Quantifiers Vs. Distrustful Adversaries,
07, 443--455
Zachos, S., Heller, H.:
A New Characterization of BPP,
04, 179--187
Zaroliagis, C., see Pantziou, G.
Zaroliagis, C.D., see Arikati, S.R.
Zhang, H., see Kapur, D.
Zhang, Z., see Morin, T.L.
Zhu, B., see Asberg, B.
Zhu, Y., see Ahuja, M.
Zucca, E., see Astesiano, E.
Zucca, E., see Breu, R.
Zwick, U., see Paterson, M.
Zwiers, J., Hannemann, U., Lakhneche, Y., de Roever, W.P.:
Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems,
15, 80--95