Algorithms and Complexity: Second Italian Conference, Ciac '94, Rome, Italy, February 23-25,... Book

	On the Intellectual Terrain Around NP	1
	Advances in Graph Drawing	12
	On a Parallel-Algorithms Method for String Matching Problems	22
	Some Open Problems in Approximation	33
	New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems	40
	Learning Behaviors of Automata from Multiplicity and Equivalence Queries	54
	Measures of Boolean Function Complexity Based on Harmonic Analysis	63
	Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata	73
	Parallel Pruning Decomposition PDS and Biconnected Components of Graphs	91
	A Non-Interactive Electronic Cash System	109
	A Unified Scheme for Routing in Expander Based Networks	125
	Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem	136
	Efficient Reorganization of Binary Search Trees	152
	Time-Message Trade-Offs for the Weak Unison Problem	167
	On Set Equality-Testing	179
	On the Complexity of Some Reachability Problems	192
	On Self-Reducible Sets of Low Information Content	203
	Lower Bounds for Merging on the Hypercube	213